{"version":"1.0","provider_name":"Goseeko blog","provider_url":"https:\/\/www.goseeko.com\/blog","author_name":"Gunjan","author_url":"https:\/\/www.goseeko.com\/blog\/author\/gunjangoseeko\/","title":"What is a Minimum Spanning Tree? - Goseeko blog","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"mpRmmwiyDL\"><a href=\"https:\/\/www.goseeko.com\/blog\/what-is-a-minimum-spanning-tree\/\">What is a Minimum Spanning Tree?<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/www.goseeko.com\/blog\/what-is-a-minimum-spanning-tree\/embed\/#?secret=mpRmmwiyDL\" width=\"600\" height=\"338\" title=\"&#8220;What is a Minimum Spanning Tree?&#8221; &#8212; Goseeko blog\" data-secret=\"mpRmmwiyDL\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script type=\"text\/javascript\">\n\/* <![CDATA[ *\/\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n\/* ]]> *\/\n<\/script>\n","thumbnail_url":"https:\/\/www.goseeko.com\/blog\/wp-content\/uploads\/2021\/09\/images.png","thumbnail_width":317,"thumbnail_height":159,"description":"Minimum Spanning Tree is utilized in the Greedy technique to identify the cost or minimum path. The cost of the spanning tree is nothing but the sum of the cost of the edges in that tree."}