How can I find better fashion options for this search?
Use related searches, refine your keywords by style or occasion, and compare multiple product cards before opening store pages.
Kruskal S Algorithm Example
120 results discovered for Kruskal S Algorithm Example. Refine by style, occasion, or category to find more relevant fashion products.
Debug Information
Array
(
[meilisearch] => Array
(
[url] => https://msin.fadunews.in/indexes/zipri/search
[http_code] => 200
[response] => {"hits":[],"query":"Kruskal-S-Algorithm-Example","processingTimeMs":1,"limit":3,"offset":0,"estimatedTotalHits":0}
[curl_error] =>
[parsed] => Array
(
[hits] => Array
(
)
[query] => Kruskal-S-Algorithm-Example
[processingTimeMs] => 1
[limit] => 3
[offset] => 0
[estimatedTotalHits] => 0
)
)
[image_search] => Array
(
[url] => http://206.189.178.169:3001/?freshness=All&show=1&q=Kruskal-S-Algorithm-Example+INR+loc%3Ain
[http_code] => 200
[response] => {"name":"kruskal-s-algorithm-example inr loc:in","totalEstimatedMatches":287,"nextOffset":120,"currentOffset":0,"value":{"4BBEF84FEE7C886DD6A94A00B8277D00F032FAD2":{"name":"Fillable Online Coumadin Dosing Algorithm For INR of 2-3 Fax Email ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.Q8nyPSsxUxkBLFFs_-nsawAAAA?r=0&pid=Api","datePublished":"2022-08-14T15:32:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.pdffiller.com/preview/207/156/207156521.png","hostPageUrl":"https://www.pdffiller.com/207156521-CoumadinDosingAlgorithm2pdf-Coumadin-Dosing-Algorithm-For-INR-of-2-3-","contentSize":"6581 B","width":298,"height":386,"cDNContentUrl":"https://th.bing.com/th/id/R.43c9f23d2b315319012c516cffe9ec6b?rik=tOuP9O7HiNZtmg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2DAF230F00D7728B00A49A6DD688C7EEF48FEBB4","accentColor":"3B3B3B"},"B7FE191C5198D660AE00A9F83240B0BEBC87C43B":{"name":"Virtual Labs","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.xdkcNZwaGpZh7qkuBTdbHgHaEj?r=0&pid=Api","datePublished":"2021-03-25T04:08:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/kruskals-algorithm/images/kruskal.png","hostPageUrl":"https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/kruskals-algorithm/basic-concept.html","contentSize":"71597 B","width":882,"height":542,"cDNContentUrl":"https://th.bing.com/th/id/R.c5d91c359c1a1a9661eea92e05375b1e?rik=e%2b%2bRwRWJbQbqAA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B34C78CBEB0B04238F9A00EA066D8915C191EF7B","accentColor":"202AAB"},"1C52B1E5F71559D5DC901A85949EA83DC2E0083A":{"name":"8.3.3 Kruskal's Algorithm","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.tu3YnwD1CEwcTUu1YC29HAHaIs?r=0&pid=Api","datePublished":"2015-04-29T13:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img430.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node184.html","contentSize":"13952 B","width":953,"height":1119,"cDNContentUrl":"https://th.bing.com/th/id/R.b6edd89f00f5084c1c4d4bb5602dbd1c?rik=wSUbXn9RlV3NCQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A3800E2CD38AE94958A109CD5D95517F5E1B25C1","accentColor":"434343"},"18AF8697EAE152C6FDD516A3FFF28993EEA36747":{"name":"Kruskal Algorithm in C : Concept, Explanation & Example","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.YB9JYdEtC_wBPSlkySyZRwHaD5?r=0&pid=Api","datePublished":"2025-04-19T08:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/kruskal-algorithm-in-c-image-1.jpg","hostPageUrl":"https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c","contentSize":"156879 B","width":1432,"height":754,"cDNContentUrl":"https://th.bing.com/th/id/R.601f4961d12d0bfc013d2964c92c9947?rik=gfpoea4eJWzfXQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"74763AEE39982FFF3A615DDF6C251EAE7968FA81","accentColor":"3B015F"},"B09A89AE68710AAC408316A3FFF28993EEA36747":{"name":"Kruskal Algorithm in C : Concept, Explanation & Example","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.zLXMqPvJ4g5BgtOpRTVLqAHaE_?r=0&pid=Api","datePublished":"2025-04-19T08:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/kruskal-algorithm-in-c-image-4.jpg","hostPageUrl":"https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c","contentSize":"131401 B","width":1120,"height":754,"cDNContentUrl":"https://th.bing.com/th/id/R.ccb5cca8fbc9e20e4182d3a945354ba8?rik=C6mY6oYXoMoEOA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"74763AEE39982FFF3A613804CAA01786EA98A90B","accentColor":"3B005F"},"737D5725F1703F32F4E5CC97A678DF4CDABBFB0A":{"name":"KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.zgyg6VZCQCTMO8X1i3KCjQHaIh?r=0&pid=Api","datePublished":"2020-09-13T18:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Kruskals1.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree.htm","contentSize":"88030 B","width":634,"height":730,"cDNContentUrl":"https://th.bing.com/th/id/R.ce0ca0e956424024cc3bc5f58b72828d?rik=N9d1Uh8H8yNPXg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A0BFBBADC4FD876A79CC5E4F23F3071F5275D737","accentColor":"C43A07"},"571EE8D0DB044C0819D6154D0018223319668550":{"name":"Minimum Spanning Tree - Operations, Algorithm with Example C Programs ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.mzXyP4MB240_P2eGOGpivAAAAA?r=0&pid=Api","datePublished":"2023-08-24T08:25:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.poriyaan.in/media/imgPori/images51/PUt4Rq1.jpg","hostPageUrl":"https://cse.poriyaan.in/topic/minimum-spanning-tree-50557/","contentSize":"41405 B","width":383,"height":747,"cDNContentUrl":"https://th.bing.com/th/id/R.9b35f23f8301db8d3f3f6786386a62bc?rik=deGODb1AxICRbQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0558669133228100D4516D9180C440BD0D8EE175","accentColor":"5F646C"},"475312664A19423B184E154D0018223319668550":{"name":"Minimum Spanning Tree - Operations, Algorithm with Example C Programs ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.wDOjlQIOE1bIeYlGyAOtZgAAAA?r=0&pid=Api","datePublished":"2023-08-24T08:25:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.poriyaan.in/media/imgPori/images51/yCIMxME.jpg","hostPageUrl":"https://cse.poriyaan.in/topic/minimum-spanning-tree-50557/","contentSize":"14522 B","width":263,"height":233,"cDNContentUrl":"https://th.bing.com/th/id/R.c033a395020e1356c8798946c803ad66?rik=dDUhZqSRJLOB5A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0558669133228100D451E481B32491A466213574","accentColor":"61636A"},"9A143FD14131B889D4606C482376ABCBD017378F":{"name":"27) Find Minimum Spanning Tree for the given graph using Kruskal's ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.dirPaWjstGXoTRS8spOttwHaCf?r=0&pid=Api","datePublished":"2023-11-19T08:44:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/da5/ef1a5c73b85c755dbc9d2bbcee7319cf.jpg","hostPageUrl":"https://brainly.in/question/58738214","contentSize":"15504 B","width":882,"height":297,"cDNContentUrl":"https://th.bing.com/th/id/R.762acf6968ecb465e84d14bcb293adb7?rik=qUHzHRQTi5hNBg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F873710DBCBA673284C6064D988B13141DF341A9","accentColor":"725A59"},"EF80BDC71939E7CB553DC2B1422920561274E94F":{"name":"Kruskal’s Algorithm: Minimum Cost Spanning Tree - 2 Video Lecture ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.21-LmWW0ywN2TiA5WfmKQwHaFj?r=0&pid=Api","datePublished":"2023-11-22T14:17:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://img.youtube.com/vi/MPeS-vf5FW0/0.jpg","hostPageUrl":"https://edurev.in/v/318573/Mastering-Kruskal%E2%80%99s-Algorithm-Minimum-Cost-Spanning-Tree-Explained-PART-2-GATE-COMPUTER-SCIENCE","contentSize":"10698 B","width":480,"height":360,"cDNContentUrl":"https://th.bing.com/th/id/R.db5f8b9965b4cb03764e203959f98a43?rik=%2fgjbfJGTfrxV0w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F49E4721650292241B2CD355BC7E93917CDB08FE","accentColor":"C60507"},"C45C758C302F5BD4F0C36ABECA7FA0C1081C446C":{"name":"Which of the following edges form minimum spanning tree on the graph ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.akKMzxTgd1MACNlHaiEHVgHaGX?r=0&pid=Api","datePublished":"2020-03-19T06:09:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d91/5a0967e91e7a017712a72dc83bcf439d.jpg","hostPageUrl":"https://brainly.in/question/16057730","contentSize":"66829 B","width":875,"height":752,"cDNContentUrl":"https://th.bing.com/th/id/R.6a428ccf14e077530008d9476a210756?rik=TMVXyAPytU0PPA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C644C1801C0AF7ACEBA63C0F4DB5F203C857C54C","accentColor":"1675B3"},"3FC3B70A87E3D58AAD7A0CBAD2F01953652E7AF5":{"name":"Minimum Cost Spanini tree using Kruskal's Algorithm. - Brainly.in","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.BHl0L-5iCeSylauBdFTHWQHaFr?r=0&pid=Api","datePublished":"2024-12-20T17:47:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d73/e6b70576befad3489a5ed2e805c1a72d.jpg","hostPageUrl":"https://brainly.in/question/61539413","contentSize":"23093 B","width":825,"height":633,"cDNContentUrl":"https://th.bing.com/th/id/R.0479742fee6209e4b295ab817454c759?rik=8zx7oHg%2bXajapw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5FA7E25635910F2DABC0A7DAA85D3E78A07B3CF3","accentColor":"414141"},"A6B1EBDF377D94937197154D0018223319668550":{"name":"Minimum Spanning Tree - Operations, Algorithm with Example C Programs ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.-HCnOhBWBlalmwFzEGNe2QHaDB?r=0&pid=Api","datePublished":"2023-08-24T08:25:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.poriyaan.in/media/imgPori/images51/Fru4WKH.jpg","hostPageUrl":"https://cse.poriyaan.in/topic/minimum-spanning-tree-50557/","contentSize":"53023 B","width":559,"height":228,"cDNContentUrl":"https://th.bing.com/th/id/R.f870a73a10560656a59b017310635ed9?rik=ahu%2b%2fXPXSTkXeQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0558669133228100D45179173949D773FDBE1B6A","accentColor":"4C567F"},"16CEFB2F08849F648D6A193CCBC567D5C55E3F17":{"name":"Kruskal's Algorithm Implementation in C for MST - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.M7AuL_8DUHWYMIrdcz_LqwHaKd?r=0&pid=Api","datePublished":"2025-12-23T06:32:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/16f48585697c6f29221556609282b00e/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/data-structures-analysis-of-algorithms/kruskals-algorithm-implementation-in-c-for-mst/149368646","contentSize":"98253 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.33b02e2fff03507598308add733fcbab?rik=Yey%2f8oBI%2bUbYpg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"71F3E55C5D765CBCC391A6D846F94880F2BFEC61","accentColor":"373737"},"5B859148B57A9D4429DEB86C08BDB3B31E6B4659":{"name":"MST Kruskal Example - ABC - Kruskal’s algorithm Example Example: Apply ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.CaRBpMq6Y0PJsOv9n2x84gHaKd?r=0&pid=Api","datePublished":"2025-03-30T10:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/64f84b4a3b7c11afdb17de73316720a5/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-mumbai/analysis-of-algorithms/mst-kruskal-example-abc/122363404","contentSize":"214674 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.09a441a4caba6343c9b0ebfd9f6c7ce2?rik=tVgZhFun2USS7Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9564B6E13B3BDB80C68BED9244D9A75B841958B5","accentColor":"CC0012"},"9E66A185BF0A0D2E24825D63A01F98A2012AB886":{"name":"Code: A-20","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.OQo5gQRMcijDTuVYcgwgvgAAAA?r=0&pid=Api","datePublished":"2010-02-13T05:11:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://www.iete-elan.ac.in/QPDec08/AC06-10-D08_files/image009.jpg","hostPageUrl":"http://iete-elan.ac.in/QPDec08/AC06-10-D08.htm","contentSize":"11979 B","width":360,"height":232,"cDNContentUrl":"https://th.bing.com/th/id/R.390a3981044c7228c34ee558720c20be?rik=6WYaWPug0OJCKA&riu=http%3a%2f%2fwww.iete-elan.ac.in%2fQPDec08%2fAC06-10-D08_files%2fimage009.jpg&ehk=Hrmeq4csks7HEY2j0vz3r3MQXnkL4AHzXIZxs%2b9sVxo%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"688BA2102A89F10A36D52842E2D0A0FB581A66E9","accentColor":"666666"},"F51970AE13A5D10C9F80CC97A678DF4CDABBFB0A":{"name":"KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.Z8QdarENdQ-26ALYGSf9hwHaIg?r=0&pid=Api","datePublished":"2020-09-13T18:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Kruskals10.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree.htm","contentSize":"52850 B","width":636,"height":730,"cDNContentUrl":"https://th.bing.com/th/id/R.67c41d6ab10d750fb6e802d81927fd87?rik=X5EH6jFaHcD5CA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A0BFBBADC4FD876A79CC08F9C01D5A31EA07915F","accentColor":"C63905"},"114BFE7657471B8E7ECDA6E852F5BF5D0220859B":{"name":"KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE CODE","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.aV5ZxSjfiTp8Qj76VzSEfAHaG1?r=0&pid=Api","datePublished":"2020-09-22T00:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/KruskasCode3.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree-Code.htm","contentSize":"53939 B","width":658,"height":607,"cDNContentUrl":"https://th.bing.com/th/id/R.695e59c528df893a7c423efa5734847c?rik=EbTvZ3V0sejn3A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B9580220D5FB5F258E6ADCE7E8B1747567EFB411","accentColor":"C63805"},"243363CCBC7A1D77691D5DFBD3F32D0F2533C537":{"name":"Virtual Labs","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.QxMwBHEHKrJ2ixpOSfdSrgHaDW?r=0&pid=Api","datePublished":"2021-03-25T04:08:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/prims-algorithm/images/primfinal.png","hostPageUrl":"https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/prims-algorithm/demo-of-prims-algorithm.html","contentSize":"106898 B","width":1231,"height":556,"cDNContentUrl":"https://th.bing.com/th/id/R.4313300471072ab2768b1a4e49f752ae?rik=QjM2zMun0XeW0Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"735C3352F0D23F3DBFD5D19677D1A7CBCC363342","accentColor":"202AAB"},"5AEBA3BF9ADE58C01B6BCC97A678DF4CDABBFB0A":{"name":"KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.YDvm0gj_SJakAEKI9kPoKgHaIg?r=0&pid=Api","datePublished":"2020-09-13T18:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Kruskals8.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree.htm","contentSize":"48321 B","width":635,"height":730,"cDNContentUrl":"https://th.bing.com/th/id/R.603be6d208ff4896a4004288f643e82a?rik=pb46%2b6nthQyxtg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A0BFBBADC4FD876A79CCB6B10C85EDA9FB3ABEA5","accentColor":"C83803"},"335E930D81AE1F49E0187113817FC20D49D509CA":{"name":"Algorithms: TIFR CSE 2014 | Part B | Question: 4","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.klNj-dqpJ4TuzRogaILjlwAAAA?r=0&pid=Api","datePublished":"2021-07-02T14:20:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=15888888460484087290","hostPageUrl":"https://gateoverflow.in/27174/tifr-cse-2014-part-b-question-4","contentSize":"7552 B","width":418,"height":292,"cDNContentUrl":"https://th.bing.com/th/id/R.925363f9daa92784eecd1a206882e397?rik=M%2bU50Bjq8ZQOgQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AC905D94D02CF7183117810E94F1EA18D039E533","accentColor":"232323"},"F01B3429FB836C5C9F8789D46063BC1E0F756B03":{"name":"Kruskal's Algorithm - Algorithms - Computer Science Engineering (CSE ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.l81ge4tGjsWoAWhw0u8V4gHaDN?r=0&pid=Api","datePublished":"2022-11-24T19:37:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/1611931_8cb39534-8d51-422c-a440-907634781030_lg.png","hostPageUrl":"https://edurev.in/t/248472/Kruskal-s-Algorithm","contentSize":"20391 B","width":600,"height":260,"cDNContentUrl":"https://th.bing.com/th/id/R.97cd607b8b468ec5a8016870d2ef15e2?rik=D7FDkr84xsX5eA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"30B657F0E1CB36064D9878F9C5C638BF9243B10F","accentColor":"00CB07"},"B2A7E5A305D261BF8BC5519DD7BF53A24AF3510B":{"name":"Practical no.8 Kruskal’s Algorithm - Practical no- 8 Code and analyze ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.U_Ii2RStbDTdVZRmmcGaugHaKd?r=0&pid=Api","datePublished":"2024-04-17T19:32:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/f332eee814f991af97a4f57036b2d3ac/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/i-k-gujral-punjab-technical-university/data-structures-laboratory/practical-no8-kruskals-algorithm/90605428","contentSize":"116841 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.53f222d914ad6c34dd55946699c19aba?rik=K3peOlAtFvu4XA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B0153FA42A35FB7DD9155CB8FB162D503A5E7A2B","accentColor":"494949"},"DC92323CD9B34D484030D103D49D2BFCFD9D4C6A":{"name":"Prims and Kruskal Algorithm - Prims and Kruskal Algorithm Overview Prim ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.BFYY_Yt0gxZzu71Iz9Y7PwHaJl?r=0&pid=Api","datePublished":"2023-03-11T15:48:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/f53681050f0b064930d60e087860e5d7/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-mumbai/mumbai-university/prims-and-kruskal-algorithm/50530599","contentSize":"347729 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.045618fd8b74831673bbbd48cfd63b3f?rik=zSkjw5071IQEAw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A6C4D9DFCFB2D94D301D030484D43B9DC32329CD","accentColor":"4F6077"},"52B44888AD91DF38932966DFB758BE9FDDCF91B8":{"name":"Number of Connected Components in an Undirected Graph - [LC Premium]","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.nw_1Kt8MptbegZDyUF7ooAHaDu?r=0&pid=Api","datePublished":"2024-12-10T08:15:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://learn.innoskrit.in/content/images/2024/02/image-1.png","hostPageUrl":"https://learn.innoskrit.in/graph/number-of-connected-components-in-an-undirected-graph/","contentSize":"175391 B","width":2817,"height":1419,"cDNContentUrl":"https://th.bing.com/th/id/R.9f0ff52adf0ca6d6de8190f2505ee8a0?rik=JUuEiNoZ%2fYM5kg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"8B19FCDDF9EB857BFD66923983FD19DA88844B25","accentColor":"CC004E"},"086B6BC5E33B7E249E5B16A3FFF28993EEA36747":{"name":"Kruskal Algorithm in C : Concept, Explanation & Example","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.0V8U6uOw8MXqx3ToVxpPNgHaDS?r=0&pid=Api","datePublished":"2025-04-19T08:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/kruskal-algorithm-in-c-home.png","hostPageUrl":"https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c","contentSize":"293091 B","width":739,"height":328,"cDNContentUrl":"https://th.bing.com/th/id/R.d15f14eae3b0f0c5eac774e8571a4f36?rik=gLa2XD6z50LptQ&pid=ImgRaw&r=0","isTransparent":true,"imageId":"74763AEE39982FFF3A61B5E942E7B33E5CB6B680","accentColor":"CC6C00"},"6AAD30D8B88B2AE74CEE8CD1AF15BB5E1D904594":{"name":"Kruskal's Algorithm: Understanding and Implementation Guide - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.fY-fqh4v_9JZWrc1JKC-TwHaKe?r=0&pid=Api","datePublished":"2023-11-28T05:41:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/143bf4a9fb90baa56bf6bc8d0c57fa36/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/bca-data-structure/kruskals-algorithm-javatpoint/77865929","contentSize":"503093 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.7d8f9faa1e2fffd2595ab73524a0be4f?rik=ptoDjYu4on7E7g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"495409D1E5BB51FA1DC8EEC47EA2B88B8D03DAA6","accentColor":"063C6D"},"F3D4DCC03C67AF020264154D0018223319668550":{"name":"Minimum Spanning Tree - Operations, Algorithm with Example C Programs ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.1RCkxS15nFgl6-jnzNi_eAHaSY?r=0&pid=Api","datePublished":"2023-08-24T08:25:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.poriyaan.in/media/imgPori/images51/kpOdWa1.jpg","hostPageUrl":"https://cse.poriyaan.in/topic/minimum-spanning-tree-50557/","contentSize":"117278 B","width":541,"height":1343,"cDNContentUrl":"https://th.bing.com/th/id/R.d510a4c52d799c5825ebe8e7ccd8bf78?rik=P03NDMN2%2biAgRg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0558669133228100D451462020FA76C30CCD4D3F","accentColor":"5C5C6F"},"C472C5FD206BB4DB1C5B51B56217B10C56F43447":{"name":"Josephus Problem & Kruskal's Algorithm Overview - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.SBOwUdPuMof43aMYBOW0HwHaJl?r=0&pid=Api","datePublished":"2025-12-23T21:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/d402d85128a3eca587cfcbcb7d199cc7/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/srm-institute-of-science-and-technology/data-structures-and-algorithms/josephus-problem-kruskals-algorithm-overview/149356131","contentSize":"68376 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.4813b051d3ee3287f8dda31804e5b41f?rik=TCdc3wK2S73BtQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"74434F65C01B71265B15B5C1BD4BB602DF5C274C","accentColor":"666666"},"878CCC510A5083039A08BD280A688D4722EF7086":{"name":"Faculty Blogs","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.48WWx7fPRXkgJ12Mglc9vgHaDG?r=0&pid=Api","datePublished":"2022-10-23T05:41:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://cdn.programiz.com/sites/tutorial2program/files/dj-2.png","hostPageUrl":"https://marwaricollegeranchi.ac.in/FacultyBlogDetails.aspx?pid=Bachelor%20of%20Science%20in%20Computer%20Application&rid=prasadanjana23@gmail.com&bid=183","contentSize":"70715 B","width":1460,"height":612,"cDNContentUrl":"https://th.bing.com/th/id/R.e3c596c7b7cf457920275d8c82573dbe?rik=eMjMFaAFODCpgA&pid=ImgRaw&r=0","isTransparent":true,"imageId":"6807FE2274D886A082DB80A9303805A015CCC878","accentColor":"6208C3"},"BD49D81C638A25749BFC84DD04C5CDE760AE2C73":{"name":"Lab Assignment 12: Implementing Kruskal's Algorithm for MST - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.5YXbftrOkHF-RGKMwul0aQHaJl?r=0&pid=Api","datePublished":"2025-12-27T20:38:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/d2ed94f72403fe7135766c145573fe92/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/techno-india-university-west-bengal/database-and-management-system/lab-assignment-12-implementing-kruskals-algorithm-for-mst/149708206","contentSize":"96495 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.e585db7edace90717e44628cc2e97469?rik=25SNwTaoUke5zw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"37C2EA067EDC5C40DD48CFB94752A836C18D94DB","accentColor":"3C3C3C"},"146AFFAFD54994C0F9A4FDB0E7741F5218C5C743":{"name":"C Sharp - Kruskal's Algorithm - Minimum Spanning Tree - Code","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.1cJUVm-wfwT1n-T5hy_bVAHaCM?r=0&pid=Api","datePublished":"2023-08-06T18:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/csharp/Images/C-Sharp-Kruskal's-Algorithm-Minimum-Spanning-Tree-Code12.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/csharp/C-Sharp-Kruskal's-Algorithm-Minimum-Spanning-Tree-Code.htm","contentSize":"17334 B","width":636,"height":188,"cDNContentUrl":"https://th.bing.com/th/id/R.d5c254566fb07f04f59fe4f9872fdb54?rik=Qab%2f%2bl2USQyfSg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"347C5C8125F1477E0BDF4A9F0C49945DFAFFA641","accentColor":"C73904"},"9B81CE226658ACC5EC435DE527BCB54829896F79":{"name":"Python - Kruskal's Algorithm Minimum Spanning Tree Code","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.VDLC7KCiiFEkmYQhCI4k6AAAAA?r=0&pid=Api","datePublished":"2023-08-06T18:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Images/Python-Kruskal's-Algorithm-Minimum-Spanning-Tree-Code2.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Python-Kruskal's-Algorithm-Minimum-Spanning-Tree-Code.htm","contentSize":"9081 B","width":372,"height":402,"cDNContentUrl":"https://th.bing.com/th/id/R.5432c2eca0a2885124998421088e24e8?rik=uRjsImaFylzONA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"97F69892845BCB725ED534CE5CCA856622EC18B9","accentColor":"C72804"},"64D53162D956A573844B5A1494C3A679895A32CE":{"name":"Kruskal ALGORITHM - /Program Name: Minimum spanning tree using Kruskal ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.O1OH0wC3-6BO4MehsY0kQgHaJl?r=0&pid=Api","datePublished":"2024-04-11T08:34:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/4db572c4521897e02624a7708068f1ce/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/nims-university/computer-science/kruskal-algorithm/89301988","contentSize":"92550 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.3b5387d300b7fba04ee0c7a1b18d2442?rik=Rl0TJp1lWjdItA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"EC23A598976A3C4941A5B448375A659D26135D46","accentColor":"434343"},"ECE2649B5118793BDF16A6E852F5BF5D0220859B":{"name":"KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE CODE","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.xdVvDfn3jjmZ5QoOWpxdjgHaEi?r=0&pid=Api","datePublished":"2020-09-22T00:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/KruskasCode1.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree-Code.htm","contentSize":"38267 B","width":608,"height":373,"cDNContentUrl":"https://th.bing.com/th/id/R.c5d56f0df9f78e3999e50a0e5a9c5d8e?rik=zi5GuRWBl7P9YQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B9580220D5FB5F258E6A61FDB3978115B9462ECE","accentColor":"C83803"},"FB9D5A70A682753FAEA42F8E5142397C6FB1D9C0":{"name":"Program 9: C Implementation of Minimum Spanning Tree using Kruskal's ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.LTIfu_Y0dhl2pGpjwUakjgHaKd?r=0&pid=Api","datePublished":"2025-12-31T00:40:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/b455e8467dd6c54967cabc9127c6a6ea/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/btech-cse-3rd-year/program-9-c-implementation-of-minimum-spanning-tree-using-kruskals-algorithm/149841793","contentSize":"115329 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.2d321fbbf634761976a46a63c146a48e?rik=v9mlB2ooV%2fPqSg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0C9D1BF6C7932415E8F24AEAF357286A07A5D9BF","accentColor":"454545"},"6FFB7CB3D3C145117142FABB50CAF09E5E98C415":{"name":"DAA: Prim's and Kruskal's Algorithms for MST Construction - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.bnGSCw1jqWHzN30qofu2hAHaEK?r=0&pid=Api","datePublished":"2025-11-27T07:34:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/4ce46510e18caedb4a953b4ca6b44265/thumb_784_441.png","hostPageUrl":"https://www.studocu.com/in/document/rani-channamma-university/bachelors-of-computer-application/daa-prims-and-kruskals-algorithms-for-mst-construction/146957871","contentSize":"23724 B","width":784,"height":441,"cDNContentUrl":"https://th.bing.com/th/id/R.6e71920b0d63a961f3377d2aa1fbb684?rik=9r%2fHOz0cVBEXJA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"514C89E5E90FAC05BBAF241711541C3D3BC7BFF6","accentColor":"373737"},"FA222BF8F58BD9E4A44C89D46063BC1E0F756B03":{"name":"Kruskal's Algorithm - Algorithms - Computer Science Engineering (CSE ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.tMsMEDM-eLF-q39KjjxtGAAAAA?r=0&pid=Api","datePublished":"2022-11-24T19:37:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/1611931_23473e9e-c641-43e8-aaac-bffdbba6154e_lg.png","hostPageUrl":"https://edurev.in/t/248472/Kruskal-s-Algorithm","contentSize":"5738 B","width":278,"height":250,"cDNContentUrl":"https://th.bing.com/th/id/R.b4cb0c10333e78b17eab7f4a8e3c6d18?rik=ryKyj1%2b4nU5KxA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"30B657F0E1CB36064D98C44A4E9DB85F8FB222AF","accentColor":"01CA0A"},"2D7117EA03F4CCC5C5A8290B65F516D9CAECEAAA":{"name":"Kruskal’s algorithm - Kruskal’s algorithm Kruskal’s algorithm is a ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.bivNtgYN8GoOfKZYTxFjbgHaJl?r=0&pid=Api","datePublished":"2023-04-04T08:53:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/edc5d90bfa4a454c079cd8fca4372060/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/nirmala-college/structured-programming-in-c/kruskals-algorithm/52845533","contentSize":"171804 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.6e2bcdb6060df06a0e7ca6584f11636e?rik=0hdxrjBPzFxcig&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AAAECEAC9D615F56B0928A5C5CCC4F30AE7117D2","accentColor":"4B4B4B"},"8099357768C5B4A5C864D7C6AEF01B243F88BF9B":{"name":"Kruskal algorithm - Kruskal’s algorithm is a greedy algorithm for ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.5pf4zOs6ikcVvVEapod33QHaKe?r=0&pid=Api","datePublished":"2023-03-26T17:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/ac19c64cc4d0b2cc1978d783be72eeab/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/indian-institute-of-technology-roorkee/quantum-physics/kruskal-algorithm/48725170","contentSize":"252755 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.e697f8cceb3a8a4715bd511aa68777dd?rik=CJlTd4ZcS1qMRg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B9FB88F342B10FEA6C7D468C5A4B5C8677539908","accentColor":"666666"},"2D8DD62AA3CAF60F1DBA9D747346A3C24E441167":{"name":"8.3.2 Prim's Algorithm","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.M_3T1CI4E0huWl5oqsr0LwHaF-?r=0&pid=Api","datePublished":"2018-04-02T13:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img425.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node183.html","contentSize":"9456 B","width":1033,"height":833,"cDNContentUrl":"https://th.bing.com/th/id/R.33fdd3d4223813486e5a5e68aacaf42f?rik=0thtojqsb%2fDRqw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"761144E42C3A643747D9ABD1F06FAC3AA26DD8D2","accentColor":"474747"},"379CFAD34B3A0A52B9EC2391F35AFD01681F1F05":{"name":"Minimum Spanning Tree Experiment No 7: Prim's and Kruskal's Algorithms ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.DMfxAimixHCvuA8Rw9HK-AHaKd?r=0&pid=Api","datePublished":"2024-11-02T07:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/8763ff0253b1cf7631e1f59a68b46e1d/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/practical-no-7/109406852","contentSize":"335725 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.0cc7f10229a2c470afb80f11c3d1caf8?rik=c8mvPbSjoCWbzg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"50F1F18610DFA53F1932CE9B25A0A3B43DAFC973","accentColor":"7C0232"},"781143FE2705CCD001371A85949EA83DC2E0083A":{"name":"8.3.3 Kruskal's Algorithm","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.Wh0r27tUNoq8BSU5rD9YsgAAAA?r=0&pid=Api","datePublished":"2015-04-29T13:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img422.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node184.html","contentSize":"224 B","width":20,"height":45,"cDNContentUrl":"https://th.bing.com/th/id/R.5a1d2bdbbb54368abc052539ac3f58b2?rik=hxE073JQzA0Qcw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A3800E2CD38AE94958A173100DCC5072EF341187","accentColor":"666666"},"945C5D1114753304DE36FA69A8B58B50B2374BA7":{"name":"Algorithms: Do Prim’s and Kruskal’s algorithms still work if the edge ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.n8yFy0yAcYqy3VzUWip3ngAAAA?r=0&pid=Api","datePublished":"2015-10-13T16:52:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=8674054686674281952","hostPageUrl":"https://gateoverflow.in/19537/prims-kruskals-algorithms-still-weights-allowed-negative","contentSize":"4490 B","width":233,"height":216,"cDNContentUrl":"https://th.bing.com/th/id/R.9fcc85cb4c80718ab2dd5cd45a2a779e?rik=ScXVEUFXM0DtYw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7AB4732B05B85B8A96AF63ED4033574111D5C549","accentColor":"545956"},"7BA373FC179BB043E3CFF6EA5F4D05FD1FF32CCB":{"name":"Entry #6 by ceesjandronkers for Custom Prim's and Kruskal's Algorithms ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.cfpXkfJfyJyZsiPUMCo5fwHaEn?r=0&pid=Api","datePublished":"2023-06-12T00:06:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://cdn3.f-cdn.com/contestentries/1910199/53783617/605910018fe13_thumb900.jpg","hostPageUrl":"https://www.freelancer.in/contest/custom-prims-and-kruskals-algorithms-1910199-byentry-50500857","contentSize":"23739 B","width":900,"height":562,"cDNContentUrl":"https://th.bing.com/th/id/R.71fa5791f25fc89c99b223d4302a397f?rik=tzo3z3G5CzQ%2b%2fA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"BCC23FF1DF50D4F5AE6FFC3E340BB971CF373AB7","accentColor":"BF0C0E"},"52C62791926332B8471980DD23D1F3FFB91C5FFB":{"name":"Aad-part11 - Lecture notes 11 - Kruskal’s Algorithm Kruskal's algorithm ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.fphOMOGM6H7RG92oPQUAgAHaJl?r=0&pid=Api","datePublished":"2022-03-05T20:25:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/1b67487c2333853c274cade55fc6a881/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/algorithm-analysis-and-design/aad-part11-lecture-notes-11/22295457","contentSize":"133607 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.7e984e30e18ce87ed11bdda83d050080?rik=JWxyGSk2I4t0kQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"BFF5C19BFF3F1D32DD0891748B23362919726C25","accentColor":"474747"},"0B967AFAD4FFC2035BE5E193EF9A93CFCF3BF155":{"name":"Kruskal’s Algorithm: Minimum Cost Spanning Tree - 1 Video Lecture ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.UJ-lzqByAbzGIEtWMsNdkwHaFj?r=0&pid=Api","datePublished":"2023-11-22T14:17:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://img.youtube.com/vi/wJ5RPCarrlI/0.jpg","hostPageUrl":"https://edurev.in/v/318572/Mastering-Kruskal%E2%80%99s-Algorithm-Minimum-Cost-Spanning-Tree-Explained-PART-1-GATE-COMPUTER-SCIENCE","contentSize":"12071 B","width":480,"height":360,"cDNContentUrl":"https://th.bing.com/th/id/R.509fa5cea07201bcc6204b5632c35d93?rik=sGmnr03%2fLDC1Xg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"551FB3FCFC39A9FE391E5EB5302CFF4DAFA769B0","accentColor":"C50607"},"AB6E8C2825E6C60B1361D2A00833009A8F902857":{"name":"Algorithms: #Algorithms How is this equivalent in Kruskal's Algorithm's ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.r_EQj6cWmioOpmnjqK7HnAHaJ5?r=0&pid=Api","datePublished":"2018-05-12T23:54:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=10251424452337358031","hostPageUrl":"https://gateoverflow.in/213053/%23algorithms-this-equivalent-kruskals-algorithms-complexity","contentSize":"73285 B","width":600,"height":802,"cDNContentUrl":"https://th.bing.com/th/id/R.aff1108fa7169a2a0ea669e3a8aec79c?rik=uubIglJubLAxFg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"758209F8A90033800A2D1631B06C6E5282C8E6BA","accentColor":"576274"},"DE4EF6153515245439481A85949EA83DC2E0083A":{"name":"8.3.3 Kruskal's Algorithm","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.QoBu5vFnIU_daQxu1C71uwAAAA?r=0&pid=Api","datePublished":"2015-04-29T13:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img68.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node184.html","contentSize":"161 B","width":22,"height":42,"cDNContentUrl":"https://th.bing.com/th/id/R.42806ee6f167214fdd690c6ed42ef5bb?rik=7eRvUVNRQkWThA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A3800E2CD38AE94958A1849345425153516FE4ED","accentColor":"0E0E0E"},"017A90A8C3DE3F46FC9F520F56E63EED73342639":{"name":"Module 3 - Greedy algorithm ,Knapsack algorithm and Kruskal's algorithm ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.AMzffImwHzLqMMtBuMPj0AHaJl?r=0&pid=Api","datePublished":"2022-07-03T18:55:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/4858075312687e549b10e7a11c8d9c1a/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/mahatma-gandhi-university/analysis-design-of-algorithms/module-3-greedy-algorithm-knapsack-algorithm-and-kruskals-algorithm/29825740","contentSize":"305061 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.00ccdf7c89b01f32ea30cb41b8c3e3d0?rik=EKcJijzt82TP%2bQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"93624337DEE36E65F025F9CF64F3ED3C8A09A710","accentColor":"B61515"},"AAEE7F74208211C54E649F324DAF6C41E0EAB590":{"name":"SE&PM -notes(BCS501) - Software engineering module 1 notes - Navkis ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.SdOo7OG8FbHbwXQ9WVmqBgHaKd?r=0&pid=Api","datePublished":"2024-10-30T00:17:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/b7d1fa1a4c3b616f076c2e517a457a68/thumb_1200_1696.webp","hostPageUrl":"https://www.studocu.com/in/document/visvesvaraya-technological-university/cse/sepm-notesbcs501-software-engineering-module-1-notes/109054976","contentSize":"59854 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.49d3a8ece1bc15b1dbc1743d5959aa06?rik=qu73RwIoEVzkRg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"095BAE0E14C6FAD423F946E45C11280247F7EEAA","accentColor":"666566"},"8974767D99D38744BC7B36F3C573C1ED41CDE0C6":{"name":"Kruskal - Fghbhbbh - Kruskal's algorithm is a greedy algorithm used to ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.LPGhTtWL8Bx0wFxIm1auCQAAAA?r=0&pid=Api","datePublished":"2024-02-05T00:37:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/26494135f27a529fb5a0a30c4c466818/thumb_300_425.png","hostPageUrl":"https://www.studocu.com/in/document/annai-meenakshi-college-of-education/mechanical-engineering/kruskal-fghbhbbh/80571563","contentSize":"26918 B","width":300,"height":425,"cDNContentUrl":"https://th.bing.com/th/id/R.2cf1a14ed58bf01c74c05c489b56ae09?rik=mEdn15k9eETLtw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"6C0EDC14DE1C375C3F63B7CB44783D99D7674798","accentColor":"374E5E"},"F17B8AE697E7E772F5CEFE1BDCE68FE3B6CE1B77":{"name":"Explain the working of the Prim’s algorithm with suitable example ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.xttyICt5YzT0dCQ48UMi1gHaHq?r=0&pid=Api","datePublished":"2022-12-13T01:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://gtu-paper-solution.com/upload/2130702/S2019/Prims_Algorithm.png","hostPageUrl":"https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2019/Question-3-c","contentSize":"71322 B","width":619,"height":640,"cDNContentUrl":"https://th.bing.com/th/id/R.c6db72202b796334f4742438f14322d6?rik=H7eobnl%2bfidf7A&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fPrims_Algorithm.png&ehk=R3XVBQbOf%2flcL1i52jsbgXMD%2bElBkWu4rjUxNhYILIQ%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"77B1EC6B3EF86ECDB1EFEC5F277E7E796EA8B71F","accentColor":"654934"},"116B4A348F5956866B4831E19ED500A136B434D9":{"name":"Algorithms: TIFR CSE 2014 | Part B | Question: 5","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.JlqBQBHGugfaMZqjJF7hsAAAAA?r=0&pid=Api","datePublished":"2021-07-07T10:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=7905451498867938326","hostPageUrl":"https://gateoverflow.in/27180/tifr-cse-2014-part-b-question-5","contentSize":"2253 B","width":119,"height":127,"cDNContentUrl":"https://th.bing.com/th/id/R.265a814011c6ba07da319aa3245ee1b0?rik=EbakQ%2fiVZWi2hA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9D434B631A005DE91E1384B6686595F843A4B611","accentColor":"666666"},"E00204E03D04DBDF7D43572265A7F3DB5A70EDF5":{"name":"Binary Trees - HPTU Exam Helper","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.RI0WGsCUQbiBdzsoktxQ7AHaFu?r=0&pid=Api","datePublished":"2025-05-26T01:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://res.cloudinary.com/hptuexamhelper/image/upload/f_auto,q_auto/HT3_i2td9k.png","hostPageUrl":"https://www.hptuexamhelper.in/theory/cse/semester_iii/data_structures_and_algo/unit_iii/binary_trees","contentSize":"26427 B","width":663,"height":512,"cDNContentUrl":"https://th.bing.com/th/id/R.448d161ac09441b881773b2892dc50ec?rik=DiBADtNAvf3XNA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5FDE07A5BD3F7A56227534D7FDBD40D30E40200E","accentColor":"02C702"},"70437C7F946E95E069E716A3FFF28993EEA36747":{"name":"Kruskal Algorithm in C : Concept, Explanation & Example","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.vTDqtkPOoSHFh1U2Z0cYZQAAAA?r=0&pid=Api","datePublished":"2025-04-19T08:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/kruskal-algorithm-in-c-image-2.jpg","hostPageUrl":"https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c","contentSize":"57737 B","width":328,"height":754,"cDNContentUrl":"https://th.bing.com/th/id/R.bd30eab643cea121c587553667471865?rik=BzTH90nmWQ6Wfg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"74763AEE39982FFF3A617E960E59E649F7C73407","accentColor":"3B015F"},"CFAEC3BAE20EFD532E82CC97A678DF4CDABBFB0A":{"name":"KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.1_cpHnPgLqCOMDqLkld93gHaIS?r=0&pid=Api","datePublished":"2020-09-13T18:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Kruskals9.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree.htm","contentSize":"50472 B","width":660,"height":739,"cDNContentUrl":"https://th.bing.com/th/id/R.d7f7291e73e02ea08e303a8b92577dde?rik=%2fOo8qy7g3zXiKA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A0BFBBADC4FD876A79CC28E235DFE02EAB3CEAFC","accentColor":"C73904"},"042377BAA4E3777BC90B31E19ED500A136B434D9":{"name":"Algorithms: TIFR CSE 2014 | Part B | Question: 5","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.b1ii6zA9dE0DknB4xHbBjgAAAA?r=0&pid=Api","datePublished":"2021-07-07T10:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=9376175615755442996","hostPageUrl":"https://gateoverflow.in/27180/tifr-cse-2014-part-b-question-5","contentSize":"2129 B","width":121,"height":113,"cDNContentUrl":"https://th.bing.com/th/id/R.6f58a2eb303d744d03927078c476c18e?rik=QDJ3q0o%2bd7ecsA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9D434B631A005DE91E13B09CB7773E4AAB773240","accentColor":"666666"},"F7794D1EA9B6D6D038E8D2A00833009A8F902857":{"name":"Algorithms: #Algorithms How is this equivalent in Kruskal's Algorithm's ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.zfnjinbuySjVM1Xtb-GuvgHaIz?r=0&pid=Api","datePublished":"2018-05-12T23:54:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=3085354313699198706","hostPageUrl":"https://gateoverflow.in/213053/%23algorithms-this-equivalent-kruskals-algorithms-complexity","contentSize":"64062 B","width":600,"height":713,"cDNContentUrl":"https://th.bing.com/th/id/R.cdf9e38a76eec928d53355ed6fe1aebe?rik=f5fU4ZprbQ2Djg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"758209F8A90033800A2D8E830D6D6B9AE1D4977F","accentColor":"484F5B"},"F0A78B6448CA95A4D7703B1C8E0750194A97B097":{"name":"Surrounded Regions","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP._3-E47Ak3ByzlFThlNNdeQHaDi?r=0&pid=Api","datePublished":"2024-01-26T01:41:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://learn.innoskrit.in/content/images/size/w2400/2024/01/image-1.png","hostPageUrl":"https://learn.innoskrit.in/graph/surrounded-regions/","contentSize":"140106 B","width":2890,"height":1384,"cDNContentUrl":"https://th.bing.com/th/id/R.ff7f84e3b024dc1cb39454e194d35d79?rik=D3q4RoSsWUp9Bw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"790B79A4910570E8C1B3077D4A59AC8446B87A0F","accentColor":"C8035A"},"F5A54F5B4D818DAF87A71A85949EA83DC2E0083A":{"name":"8.3.3 Kruskal's Algorithm","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.bXnJ172N2mvKdIm_f1eX7AAAAA?r=0&pid=Api","datePublished":"2015-04-29T13:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img320.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node184.html","contentSize":"168 B","width":22,"height":21,"cDNContentUrl":"https://th.bing.com/th/id/R.6d79c9d7bd8dda6bca7489bf7f5797ec?rik=X1r0tdQY2Pp4eg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A3800E2CD38AE94958A17A78FAD818D4B5F45A5F","accentColor":"313131"},"E0550D50C0C8A43FDF4466292F880FC9BC1F5A53":{"name":"4.5 Minimum Spanning tree - Minimum cost spanning tree: Prim’s ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.wn7ut8X-ICOWIcwUs5fNDQHaKe?r=0&pid=Api","datePublished":"2022-10-20T03:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/8a84a617a2abff3cc8000283f40788eb/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/chandigarh-university/daa/45-minimum-spanning-tree/36387082","contentSize":"301752 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.c27eeeb7c5fe20239621cc14b397cd0d?rik=DlXQBQyMSvP9RA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"35A5F1CB9CF088F2926644FDF34A8C0C05D0550E","accentColor":"2C699F"},"F3B05C2680E683518106EC057D1A41CF894A91C8":{"name":"Virtual Labs","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.T2FGs1SwTTbGYuA5lVX4RwHaEZ?r=0&pid=Api","datePublished":"2021-03-25T04:08:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/analysis-of-prims/images/comparison-graph.png","hostPageUrl":"https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/analysis-of-prims/comparison-with-kruskals-and-others.html","contentSize":"12197 B","width":850,"height":505,"cDNContentUrl":"https://th.bing.com/th/id/R.4f6146b354b04d36c662e0399555f847?rik=PwvFYghuOBUYYA&pid=ImgRaw&r=0","isTransparent":true,"imageId":"8C19A498FC14A1D750CE601815386E0862C50B3F","accentColor":"BC0010"},"64929C673231D526F918BB57AEADAD0E72CD5249":{"name":"ENGINEERING MATHEMATICS CSE,AIML, AIDS Handwritten Notes by Renge Sir ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.vRL18d1UEf7aviz29-0RJgAAAA?r=0&pid=Api","datePublished":"2024-12-02T03:46:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://m.media-amazon.com/images/I/51v9tgTJWlL._SY445_SX342_QL70_ML2_.jpg","hostPageUrl":"https://www.amazon.in/ENGINEERING-MATHEMATICS-Handwritten-Notes-Renge-ebook/dp/B0DM6D8QQ7","contentSize":"26509 B","width":271,"height":445,"cDNContentUrl":"https://th.bing.com/th/id/R.bd12f5f1dd5411fedabe2cf6f7ed1126?rik=RinJdiMTXWKfgQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9425DC27E0DADAEA75BB819F625D132376C92946","accentColor":"997B32"},"6913BC55F186345DC0CA6EB35305C8771EE0C4DD":{"name":"Transportation networks","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.omVrDIv9YFI_6ceWQEsKqgHaGF?r=0&pid=Api","datePublished":"2016-03-13T18:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.civil.iitb.ac.in/tvm/1100_LnTse/135_lntse/plain/img17.gif","hostPageUrl":"https://www.civil.iitb.ac.in/tvm/1100_LnTse/135_lntse/plain/plain.html","contentSize":"5104 B","width":509,"height":418,"cDNContentUrl":"https://th.bing.com/th/id/R.a2656b0c8bfd60523fe9c796404b0aaa?rik=ljHLVR9oQ9UMrA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"DD4C0EE1778C50353BE6AC0CD543681F55CB3196","accentColor":"666666"},"2712A04F5980120BC16431E19ED500A136B434D9":{"name":"Algorithms: TIFR CSE 2014 | Part B | Question: 5","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.Tz7-Z5NFG8E2FlSLspQeHwAAAA?r=0&pid=Api","datePublished":"2021-07-07T10:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=14503789916021985865","hostPageUrl":"https://gateoverflow.in/27180/tifr-cse-2014-part-b-question-5","contentSize":"1978 B","width":166,"height":103,"cDNContentUrl":"https://th.bing.com/th/id/R.4f3efe6793451bc13616548bb2941e1f?rik=ciEK9JUIIbAcRg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9D434B631A005DE91E13461CB0210895F40A2172","accentColor":"666666"},"E284CBF638C1AFDC207E16A3FFF28993EEA36747":{"name":"Kruskal Algorithm in C : Concept, Explanation & Example","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.V9UgjO1nOMbK20F1Frs2PAAAAA?r=0&pid=Api","datePublished":"2025-04-19T08:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://cdn.prod.website-files.com/5fa61cbbf0d432b3230f62b1/677f5eadc1710e6acd69367b_veltech-logo.png","hostPageUrl":"https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c","contentSize":"27612 B","width":176,"height":176,"cDNContentUrl":"https://th.bing.com/th/id/R.57d5208ced6738c6cadb417516bb363c?rik=Lki8b4Mc%2bs0C5w&pid=ImgRaw&r=0","isTransparent":true,"imageId":"74763AEE39982FFF3A61E702CDFA1C836FBC482E","accentColor":"A60204"},"57EE0FAA071532C7694DBA6F7E18994902A9644F":{"name":"Explain DFS and BFS with example | summer-2014","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.OvEFQpvcxXUSh-89DWaN9AAAAA?r=0&pid=Api","datePublished":"2020-12-26T17:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://gtu-paper-solution.com/upload/2130702/S2019/DFS_Example.png","hostPageUrl":"https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2014/Question-4-a","contentSize":"24185 B","width":406,"height":230,"cDNContentUrl":"https://th.bing.com/th/id/R.3af105429bdcc5751287ef3d0d668df4?rik=de7wqnBRI3yW1A&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fDFS_Example.png&ehk=azueXLkfjIxbKuTR1P6uchitrSbBRy1RK2xVFdJ7UKs%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F4469A20949981E7F6ABD4967C235170AAF0EE75","accentColor":"9A6C31"},"3C276434F0FD0298B10031E19ED500A136B434D9":{"name":"Algorithms: TIFR CSE 2014 | Part B | Question: 5","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.EBUUQwLHrYWjU84yTBPITQAAAA?r=0&pid=Api","datePublished":"2021-07-07T10:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=1637399947378826925","hostPageUrl":"https://gateoverflow.in/27180/tifr-cse-2014-part-b-question-5","contentSize":"1357 B","width":83,"height":71,"cDNContentUrl":"https://th.bing.com/th/id/R.1015144302c7ad85a353ce324c13c84d?rik=w3JGQw%2ffIIkbAA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9D434B631A005DE91E13001B8920DF0F434672C3","accentColor":"CA0101"},"198F2466E6238EE598FE16A3FFF28993EEA36747":{"name":"Kruskal Algorithm in C : Concept, Explanation & Example","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.vt6MLzU90ZXJKhNX3nnmLQAAAA?r=0&pid=Api","datePublished":"2025-04-19T08:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://cdn.prod.website-files.com/5fa61cbbf0d432b3230f62b1/67514e98a9d5bfad73b3944f_srm.png","hostPageUrl":"https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c","contentSize":"28476 B","width":176,"height":176,"cDNContentUrl":"https://th.bing.com/th/id/R.bede8c2f353dd195c92a1357de79e62d?rik=kfhCZm4y6F6J7w&pid=ImgRaw&r=0","isTransparent":true,"imageId":"74763AEE39982FFF3A61EF895EE8326E6642F891","accentColor":"BF9A0C"},"B010EAFE7A68992F941516A3FFF28993EEA36747":{"name":"Kruskal Algorithm in C : Concept, Explanation & Example","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.3nkQkIAXjtDqh-rcO-c1VgAAAA?r=0&pid=Api","datePublished":"2025-04-19T08:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://cdn.prod.website-files.com/5fa61cbbf0d432b3230f62b1/677f5ead04ab0faadc9ad1ba_anna-logo.png","hostPageUrl":"https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c","contentSize":"22270 B","width":176,"height":176,"cDNContentUrl":"https://th.bing.com/th/id/R.de79109080178ed0ea87eadc3be73556?rik=CwGu76eGmfJJUQ&pid=ImgRaw&r=0","isTransparent":true,"imageId":"74763AEE39982FFF3A615149F29986A7EFAE010B","accentColor":"9E161B"},"BB32AE989494BD9327DF82434D929DEF48CC5A20":{"name":"Extra Lecture MTH401 (13 November 2022, Sunday), Spanning Tree, Prim's ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.58oQu2v6wODqjNKsFp3-DgAAAA?r=0&pid=Api","datePublished":"2023-03-27T23:50:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/42cd6d11b381f9335b80fb8caa53ada6/thumb_300_389.png","hostPageUrl":"https://www.studocu.com/in/document/lovely-professional-university/btech-civil/extra-lecture-mth401-13-november-2022-sunday-spanning-tree-prims-and-kruskals-algorithm/39837250","contentSize":"17526 B","width":300,"height":389,"cDNContentUrl":"https://th.bing.com/th/id/R.e7ca10bb6bfac0e0ea8cd2ac169dfe0e?rik=uyPqiUlJ2zly%2fQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"02A5CC84FED929D43428FD7239DB494989EA23BB","accentColor":"666666"},"808F468EBAB1625C728A9364464B422F3788409A":{"name":"Code: A-20","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.NgQNcQ4F9HAnxWP-LTmK7wAAAA?r=0&pid=Api","datePublished":"2010-02-13T21:46:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://www.iete-elan.ac.in/QPDec06/C06-5-J06_files/image006.jpg","hostPageUrl":"http://www.iete-elan.ac.in/QPDec06/C06-5-J06.htm","contentSize":"7034 B","width":270,"height":185,"cDNContentUrl":"https://th.bing.com/th/id/R.36040d710e05f47027c563fe2d398aef?rik=CPhk6KsbJsUnqA&riu=http%3a%2f%2fwww.iete-elan.ac.in%2fQPDec06%2fC06-5-J06_files%2fimage006.jpg&ehk=1tmSOZ4bc%2fb7K2gjVvtis93l5%2ftcpODelRVuBZ%2bNe5k%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A9048873F224B4644639A827C5261BABE864F808","accentColor":"3B3B3B"},"BC43BA8749DE7590352D356BC73543E753FE13D3":{"name":"Kruskal Algorithm - Kruskal's algorithm implementation in Python ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.CuWBg14aYFjfpR2GI-tjQAAAAA?r=0&pid=Api","datePublished":"2023-06-17T15:33:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/2ef4f10cfded51ad953803498ad507a5/thumb_300_222.png","hostPageUrl":"https://www.studocu.com/in/document/bharati-vidyapeeths-college-of-engineering/artificial-intelligence/kruskal-algorithm/60864514","contentSize":"40401 B","width":300,"height":222,"cDNContentUrl":"https://th.bing.com/th/id/R.0ae581835e1a6058dfa51d8623eb6340?rik=yzSreJTtVwlT0g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3D31EF357E34537CB653D2530957ED9478AB34CB","accentColor":"4A1C04"},"C8D52067B7C170560F1832977CD74BD4C6E3F885":{"name":"7.2.1 Single Source Shortest Paths Problem: Dijkstra's Algorithm","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.Zu4tNO7k-I_zmV_hWiUkjQHaDj?r=0&pid=Api","datePublished":"2018-04-09T17:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img324.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node162.html","contentSize":"4177 B","width":692,"height":332,"cDNContentUrl":"https://th.bing.com/th/id/R.66ee2d34eee4f88ff3995fe15a25248d?rik=jF0CdnscB2XwgQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"588F3E6C4DB47DC7792381F065071C7B76025D8C","accentColor":"313131"},"354298398B4562BEDE8F67AA2CC28CC78DAECE98":{"name":"A-01/C-01/T-01","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.DTTGzUYyud9mJEhJdRbn4wAAAA?r=0&pid=Api","datePublished":"2020-12-11T05:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://iete-elan.ac.in/SolQP/ac_10_typs_08_files/image361.gif","hostPageUrl":"http://iete-elan.ac.in/SolQP/ac_10_typs_08.htm","contentSize":"1011 B","width":229,"height":156,"cDNContentUrl":"https://th.bing.com/th/id/R.0d34c6cd4632b9df662448497516e7e3?rik=UySJk7hUJuvt%2bA&riu=http%3a%2f%2fiete-elan.ac.in%2fSolQP%2fac_10_typs_08_files%2fimage361.gif&ehk=gR8iRTpkSiX7z%2bPW%2fXZxGzhQS393vDlXH5gJCsvlQMA%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"89ECEAD87CC82CC2AA76F8EDEB2654B893892453","accentColor":"000000"},"5F3C12CC4AF3A4A2A099D4FC7EBB8E36F3571E22":{"name":"Q1. Use Prim's algorithm starting at NODE A to compute the minimum ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.zk82jeCNgVLmI5mhcK96lgHaIr?r=0&pid=Api","datePublished":"2022-06-02T19:14:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/dc2/db9c88126df262a8118ec41729758567.jpg","hostPageUrl":"https://brainly.in/question/52181869","contentSize":"20857 B","width":562,"height":659,"cDNContentUrl":"https://th.bing.com/th/id/R.ce4f368de08d8152e62399a170af7a96?rik=9cMhzKQ%2fSioKmQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"22E1753F63E8BBE7CF4D990A2A4A3FA4CC21C3F5","accentColor":"666666"},"CCDCB7E1950B8A730938A9F83240B0BEBC87C43B":{"name":"Virtual Labs","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.FJMi6TCQYBBFFRYbrrjsFgHaGQ?r=0&pid=Api","datePublished":"2021-03-25T04:08:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/kruskals-algorithm/images/whenk.png","hostPageUrl":"https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/kruskals-algorithm/basic-concept.html","contentSize":"68457 B","width":715,"height":604,"cDNContentUrl":"https://th.bing.com/th/id/R.149322e9309060104515161baeb8ec16?rik=zM17HlmwqDeQgw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B34C78CBEB0B04238F9A839037A8B0591E7BCDCC","accentColor":"4E9328"},"B6512FDB487E0F97CC71572265A7F3DB5A70EDF5":{"name":"Binary Trees - HPTU Exam Helper","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.kXbuKMGeGlUqPvMiw9JSjQHaDV?r=0&pid=Api","datePublished":"2025-05-26T01:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://res.cloudinary.com/hptuexamhelper/image/upload/f_auto,q_auto/HT5_s9rhe9.png","hostPageUrl":"https://www.hptuexamhelper.in/theory/cse/semester_iii/data_structures_and_algo/unit_iii/binary_trees","contentSize":"19981 B","width":527,"height":237,"cDNContentUrl":"https://th.bing.com/th/id/R.9176ee28c19e1a552a3ef322c3d2528d?rik=axXyvYTn8HnMFw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5FDE07A5BD3F7A56227517CC79F0E784BDF2156B","accentColor":"3D8E5B"},"EF5A11596A54BBFF6D86920E6BE4996A1895C5E3":{"name":"Max Area of Island","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.WqOsyhx6XIqFvvQpjoQSswHaEl?r=0&pid=Api","datePublished":"2025-12-04T10:57:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://learn.innoskrit.in/content/images/2024/02/maxarea1-grid.jpg","hostPageUrl":"https://learn.innoskrit.in/graph/max-area-of-island/","contentSize":"91278 B","width":1053,"height":653,"cDNContentUrl":"https://th.bing.com/th/id/R.5aa3acca1c7a5c8a85bef4298e8412b3?rik=%2fqURlaZFu%2f%2fWaA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3E5C5981A6994EB6E02968D6FFBB45A69511A5FE","accentColor":"CA8501"},"8081C89E2C5A3F02E46053FFC7E76BA965E3A588":{"name":"Banker's Algorithm - practice questions - with steps - Banker’s ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.gew9GY9_JDdZ5J9-QZAdsQHaKe?r=0&pid=Api","datePublished":"2022-05-03T04:21:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/a0289e21d544c1cfa49f8d2eb613d0f1/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/vellore-institute-of-technology/computer-engineering/bankers-algorithm-practice-questions-with-steps/23250147","contentSize":"107152 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.81ec3d198f7f243759e49f7e41901db1?rik=CBiM6cKl8yBOBg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"885A3E569AB67E7CFF35064E20F3A5C2E98C1808","accentColor":"CC0000"},"B26146187B6DCFEA21BCECE94225766B0F07091D":{"name":"Strassen's Matrix Multiplication - Design analysis of algorithm - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.F-Vt7WcCRdDQ31BMYHW8NAHaKe?r=0&pid=Api","datePublished":"2024-04-06T10:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/3abd090a43495af16e74ae7cb8e60486/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/ajay-kumar-garg-engineering-college-ghaziabad/design-analysis-of-algorithm/strassens-matrix-multiplication/89053010","contentSize":"2051740 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.17e56ded670245d0d0df504c6075bc34?rik=KxZkgbfW%2fK4Syw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D19070F0B66752249ECECB12AEFCD6B78164162B","accentColor":"484B5F"},"297DCE2E406A106AD6146882F95CE8A298B73287":{"name":"8.3 Minimum-Cost Spanning Trees","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.R4q4zzzBU4nCGP9evAlRYQHaG1?r=0&pid=Api","datePublished":"2019-02-21T03:49:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img416.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node181.html","contentSize":"9407 B","width":861,"height":795,"cDNContentUrl":"https://th.bing.com/th/id/R.478ab8cf3cc15389c218ff5ebc095161?rik=ktfs4gSmAaZtQQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"78237B892A8EC59F2886416DA601A604E2ECD792","accentColor":"434343"},"5300AC54C0A4887F60CC3A1450FBD1F92DAAED30":{"name":"Unit 3: Banker’s Algorithm Example Solutions and Exercises - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.bLeMziDSYVwMCJP2zZntcQHaJl?r=0&pid=Api","datePublished":"2023-10-10T01:50:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/ef30f77ba0cf27ff1eb5feb078370ae7/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/srm-institute-of-science-and-technology/operating-systems/unit-3-bankers-algorithm/71825247","contentSize":"299190 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.6cb78cce20d2615c0c0893f6cd99ed71?rik=NQDKRQxKiPcGzA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"03DEAAD29F1DBF0541A3CC06F7884A0C45CA0035","accentColor":"5F656C"},"32F19D6C08CC54BF6C889A06449F6B6CE555F8BE":{"name":"Prim's Algorithm - unit-3 - Design analysis of algorithm - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.9SM-fFIxjBg1YHDahrNi4wHaKe?r=0&pid=Api","datePublished":"2024-04-06T10:20:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/c8130b00f14466d132bb02addc9fe3ef/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/ajay-kumar-garg-engineering-college-ghaziabad/design-analysis-of-algorithm/prims-algorithm-unit-3/89053014","contentSize":"2759984 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.f5233e7c52318c18356070da86b362e3?rik=Ix%2fZxoDMRfvGiA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"EB8F555EC6B6F94460A988C6FB45CC80C6D91F23","accentColor":"705B66"},"3055B5938E5FBB40C1AD76703C8A9DB563C5A1FB":{"name":"Job sequencing with deadlines - Design analysis of algorithm - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.8nfvKhyGODNmeE1ojuJR3wHaKe?r=0&pid=Api","datePublished":"2024-04-06T10:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a3719ca451172aa7fda4b4c7a7c1fd02/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/ajay-kumar-garg-engineering-college-ghaziabad/design-analysis-of-algorithm/job-sequencing-with-deadlines/89052998","contentSize":"1330183 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.f277ef2a1c86383366784d688ee251df?rik=A1VbOej1uwQc2g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"BF1A5C365BD9A8C30767DA1C04BBF5E8395B5503","accentColor":"3A3F91"},"220889DCFF979F2030618E074D8147A1A0E4552E":{"name":"Fractional Knapsack using Greedy Approach - Design analysis of ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.38DKHDTKtxnCfYQJjOcAOQHaKe?r=0&pid=Api","datePublished":"2024-04-06T10:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a585bfb8f0070d6ac18b92aae825f39a/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/ajay-kumar-garg-engineering-college-ghaziabad/design-analysis-of-algorithm/fractional-knapsack-using-greedy-approach/89053009","contentSize":"902614 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.dfc0ca1c34cab719c27d84098ce70039?rik=IoCYzf95%2bQIDFg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E2554E0A1A7418D470E8160302F979FFCD988022","accentColor":"A02C2B"},"98F0A7FEA92964B66AC12EB0A731C2C8A88B19D9":{"name":"Prim's Algorithm: Understanding Minimum Spanning Trees | The Flying ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.tqJtivZuBdyBabg6sbYXagHaEc?r=0&pid=Api","datePublished":"2024-06-26T04:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://theflyingbirds.in/public/posts/prims-algorithm-understanding-minimum-spanning-trees.jpg","hostPageUrl":"https://theflyingbirds.in/blog/prims-algorithm-understanding-minimum-spanning-trees","contentSize":"84503 B","width":1200,"height":720,"cDNContentUrl":"https://th.bing.com/th/id/R.b6a26d8af66e05dc8169b83ab1b6176a?rik=iQ9675qSRmumHA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9D91B88A8C2C137A0BE21CA66B46929AEF7A0F89","accentColor":"346997"},"52E4774D5F9573F37D1110151607A5CE5E747E3A":{"name":"Analysis Of Algorithms - MUM-ENGIN-001 - MU - Studocu","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.IKbPhs14kc68n1DZqYBRGAAAAA?r=0&pid=Api","datePublished":"2021-03-26T04:19:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/47b93015e57bc86ac1462d2ca8a63500/thumb_115_81.png","hostPageUrl":"https://www.studocu.com/in/course/university-of-mumbai/analysis-of-algorithms/1288090","contentSize":"10445 B","width":115,"height":81,"cDNContentUrl":"https://th.bing.com/th/id/R.20a6cf86cd7891cebc9f50d9a9805118?rik=JU531PVZNz%2fXEQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A3E747E5EC5A7061510111D73F3759F5D4774E25","accentColor":"7E4D4D"},"D364DE895E27F59C0B5CEBA86F752A8C3A12CF80":{"name":"Kruskal Wallis Anova - Chapter Summary based on IGNOU materials and ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.HXN_SBknE4EfWEDg2AaJdAHaJl?r=0&pid=Api","datePublished":"2022-08-02T09:04:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/ee8e0d5c5d9b254259899569ca2b4484/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/indira-gandhi-national-open-university/statistics-in-psychology/kruskal-wallis-anova-chapter-summary-based-on-ignou-materials-and-additional-reference-books-with/31492848","contentSize":"270528 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.1d737f48192713811f5840e0d8068974?rik=PUbtmOVyX8mwxQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"08FC21A3C8A257F68ABEC5B0C95F72E598ED463D","accentColor":"51535A"},"9CE88B919D481DC6AED8D4AF4A5F26D9D823A3A4":{"name":"Algorithms: Minimum spanning tree","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.gdn9VpQjt2SOysf-aVR_DAHaEk?r=0&pid=Api","datePublished":"2018-01-02T07:11:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=2802376283960704595","hostPageUrl":"https://gateoverflow.in/188624/minimum-spanning-tree","contentSize":"46340 B","width":600,"height":370,"cDNContentUrl":"https://th.bing.com/th/id/R.81d9fd569423b7648ecac7fe69547f0c?rik=yY64GdmE0WzqjQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4A3A328D9D62F5A4FA4D8DEA6CD184D919B88EC9","accentColor":"4C677F"},"4599B91257DF696F57AA678ADCC472F5B55D61AA":{"name":"Do kruskal's and prim generate different minimum spanning trees ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.ujCGajsM_x9_SwWuuEsK_gAAAA?r=0&pid=Api","datePublished":"2020-01-04T10:43:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d4a/de043453f9515a3cb1a2a29531969902.jpg","hostPageUrl":"https://brainly.in/question/14472485","contentSize":"3414 B","width":100,"height":100,"cDNContentUrl":"https://th.bing.com/th/id/R.ba30866a3b0cff1f7f4b05aeb84b0afe?rik=VJmbIXX9lvZ1qg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AA16D55B5F274CCDA876AA75F696FD75219B9954","accentColor":"9D3E2E"},"A425A9AB2A61991031BA725831923F6A146807B6":{"name":"Example of banker's algorithm for deadlock avoidance - Brainly.in","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.E4yni7gnhKATXH8SaKPRpgHaSP?r=0&pid=Api","datePublished":"2018-12-12T14:14:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d49/ec84f9ee7150292e089d4741fb75e693.jpg","hostPageUrl":"https://brainly.in/question/6498042","contentSize":"151785 B","width":1080,"height":2660,"cDNContentUrl":"https://th.bing.com/th/id/R.138ca78bb82784a0135c7f1268a3d1a6?rik=SlKauqIWmQETqw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"6B708641A6F329138527AB13019916A2BA9A524A","accentColor":"464A4B"},"D2E1FEE69B8A767770DD9D747346A3C24E441167":{"name":"8.3.2 Prim's Algorithm","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.R2uc9DNo9HjxMZVqlPAFrQAAAA?r=0&pid=Api","datePublished":"2018-04-02T13:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img79.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node183.html","contentSize":"180 B","width":24,"height":45,"cDNContentUrl":"https://th.bing.com/th/id/R.476b9cf43368f478f131956a94f005ad?rik=LR7vbrmoZ3cH3Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"761144E42C3A643747D9DD077767A8B96EEF1E2D","accentColor":"666666"},"D349BAB787985453205ABCABB1DE8D41FAC3FF13":{"name":"DS-Important Topics - Good morning - B. III Sem. Data Structures ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.X23VHdIE9DVK1GUfgE5KVAAAAA?r=0&pid=Api","datePublished":"2025-05-24T13:57:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/3ed80ef3c8f2de15f3c1bd19de7cc70c/thumb_300_424.png","hostPageUrl":"https://www.studocu.com/in/document/visvesvaraya-technological-university/data-structures/ds-important-topics-good-morning/127984985","contentSize":"37503 B","width":300,"height":424,"cDNContentUrl":"https://th.bing.com/th/id/R.5f6dd51dd204f4354ad4651f804e4a54?rik=PZSre3iJRTUCpQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"31FF3CAF14D8ED1BBACBA502354589787BAB943D","accentColor":"474747"},"7A170EBEAEEE0BD60DE5C04A7D3A73B8D900CC20":{"name":"Searching Strategies : Breadth First Search","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.fuKtzbeBLqPiHYVWAo0j2gHaKe?r=0&pid=Api","datePublished":"2020-12-12T18:13:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://minigranth.in/images/tutorials/AI%20IMAGES/BFS.jpg","hostPageUrl":"https://minigranth.in/artificial-intelligence-tutorial/searching-strategies-in-ai","contentSize":"179039 B","width":1240,"height":1754,"cDNContentUrl":"https://th.bing.com/th/id/R.7ee2adcdb7812ea3e21d8556028d23da?rik=p3Hg6%2brusG3QXg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"02CC009D8B37A3D7A40C5ED06DB0EEEAEBE071A7","accentColor":"434343"},"478F6073AC15AA3F197C58C663F542D7D0C52B58":{"name":"Banker's Algorithm Example Solutions and Safety Analysis - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.q7Dky7J9LJHiGK9_VHSHcQHaKe?r=0&pid=Api","datePublished":"2023-10-30T04:30:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/635626fe553619247b0d52e804a17b96/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/vellore-institute-of-technology/operating-systems/bankers-algorithm/74303173","contentSize":"176362 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.abb0e4cbb27d2c91e218af7f54748771?rik=dPgGN8pRqvORxw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"85B25C0D7D245F366C85C791F3AA51CA3706F874","accentColor":"484848"},"3490CE4C506D36075A3C1842D83E259E0486762B":{"name":"DAA-UNIT-4: Algorithms for Shortest Paths and Minimum Spanning Trees ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.V6nhqNvFR5jglkuWm1KJfgHaKd?r=0&pid=Api","datePublished":"2025-10-10T08:18:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/ea3c5940320b4577c71d4c244bf85c5f/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/sri-siddhartha-institute-of-technology/computer-science-and-engineering/daa-unit-4-algorithms-for-shortest-paths-and-minimum-spanning-trees/141226563","contentSize":"402178 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.57a9e1a8dbc54798e0964b969b52897e?rik=QwnsxAXWY3Clww&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B2676840E952E38D2481C3A57063D605C4EC0943","accentColor":"BF0C0C"},"D07F26755A988B7B2E8E6EB35305C8771EE0C4DD":{"name":"Transportation networks","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.SzjiaEjKh3ELQCi6umgtfgAAAA?r=0&pid=Api","datePublished":"2020-06-10T12:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.civil.iitb.ac.in/tvm/1100_LnTse/135_lntse/plain/img7.gif","hostPageUrl":"https://www.civil.iitb.ac.in/tvm/1100_LnTse/135_lntse/plain/plain.html","contentSize":"174 B","width":19,"height":33,"cDNContentUrl":"https://th.bing.com/th/id/R.4b38e26848ca87710b4028baba682d7e?rik=DfdiV6WJuLfi6A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"DD4C0EE1778C50353BE6E8E2B7B889A55762F70D","accentColor":"666666"},"D097D28EEE37FB53E141E509F6C548913F5FAB88":{"name":"Draw a circle of radius 7cm. From a point 12 cm away from its centre ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.SE3J-SENliOp_2GsvQcLSgHaEz?r=0&pid=Api","datePublished":"2020-08-02T13:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d34/2a23567164d7247fa9fff3a81552f2d0.png","hostPageUrl":"https://brainly.in/question/20384246","contentSize":"11413 B","width":682,"height":443,"cDNContentUrl":"https://th.bing.com/th/id/R.484dc9f9210d9623a9ff61acbd070b4a?rik=DXkt6O5zvzUeFA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"88BAF5F319845C6F905E141E35BF73EEE82D790D","accentColor":"327499"},"87C84ECBBEF14A793E473DE1E660449D41CA35E7":{"name":"Creative Coding","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.UDSfpoNkZoYaeIB-bDmo5gHaE8?r=0&pid=Api","datePublished":"2025-05-07T20:00:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ahduni.edu.in/site/assets/files/30820/predator-prey_ecosystem.jpg","hostPageUrl":"https://ahduni.edu.in/academics/schools-centres/centre-for-learning-futures/digital-curve/creative-coding/","contentSize":"10175 B","width":600,"height":400,"cDNContentUrl":"https://th.bing.com/th/id/R.50349fa6836466861a78807e6c39a8e6?rik=eIzkvOsfpJfjdA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7E53AC14D944066E1ED374E397A41FEBBCE48C78","accentColor":"C90203"},"7ED8C82D2330CC2679DDED69AB3DE0F4B9FC8820":{"name":"Stacks | Learn Everything about Stacks in DSA","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.uROZZrptm-9_IBTSxnT9BAHaE5?r=0&pid=Api","datePublished":"2023-01-23T17:10:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://talentbattle.in/Files/C4U_Images/C4U_CKEDITOR_IMAGES/IMG10951_stacks.png","hostPageUrl":"https://talentbattle.in/learn-data-structures-and-algorithms-for-free/stacks","contentSize":"74140 B","width":586,"height":387,"cDNContentUrl":"https://th.bing.com/th/id/R.b9139966ba6d9bef7f2014d2c674fd04?rik=542M0jIDzGKX3Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0288CF9B4F0ED3BA96DEDD9762CC0332D28C8DE7","accentColor":"60636B"},"10F5D804953E615987201A78D972F26B9250C9ED":{"name":"Virtual Labs","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.d4N_Oc5WyzLcrV5KtB14swAAAA?r=0&pid=Api","datePublished":"2019-09-23T16:52:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://vlabs.iitkgp.ac.in/coa/images/flow2.png","hostPageUrl":"http://vlabs.iitkgp.ac.in/coa/exp7/index.html","contentSize":"5320 B","width":399,"height":462,"cDNContentUrl":"https://th.bing.com/th/id/R.77837f39ce56cb32dcad5e4ab41d78b3?rik=AV%2bNQFnjFpV4Ag&riu=http%3a%2f%2fvlabs.iitkgp.ac.in%2fcoa%2fimages%2fflow2.png&ehk=hrg7st5%2b1nQgdEyURzPCdImo6g5DyWThgEEJtqvWRL8%3d&risl=&pid=ImgRaw&r=0","isTransparent":true,"imageId":"DE9C0529B62F279D87A102789516E359408D5F01","accentColor":"1D1D1D"},"D7526ACF445D1A3956206A9AFF31C8A6C0C1891D":{"name":"CS425: Computer Networks : Lecture 25","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.Fk4rLkP4C-70PlHkh0pnvgHaFb?r=0&pid=Api","datePublished":"2015-02-03T16:47:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.cse.iitk.ac.in/users/dheeraj/cs425/fig.lec25/dijkstra1.gif","hostPageUrl":"https://www.cse.iitk.ac.in/users/dheeraj/cs425/lec25.html","contentSize":"34887 B","width":585,"height":429,"cDNContentUrl":"https://th.bing.com/th/id/R.164e2b2e43f80beef43e51e4874a67be?rik=fSWm%2fETVoZNlAg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D1981C0C6A8C13FFA9A6026593A1D544FCA6257D","accentColor":"1D1D1D"},"8E4F7751B9F8BF1BC0B9777FE7F13842A9E278A8":{"name":"Convert the given graph with weighted edges to minimal spanning tree ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.rs2FhGcbpXDCDL46-FVCIgAAAA?r=0&pid=Api","datePublished":"2022-01-11T06:58:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d09/a8e076ed97faf9a2fec4ef7a323f18a3.jpg","hostPageUrl":"https://brainly.in/question/49476753","contentSize":"2991 B","width":100,"height":100,"cDNContentUrl":"https://th.bing.com/th/id/R.aecd8584671ba570c20cbe3af8554222?rik=6PR3FZuP%2b7EMmw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"8A872E9A24831F7EF7779B0CB1FB8F9B1577F4E8","accentColor":"704033"},"EDC99536AA26516EB61AAA0C8456CF915FA08230":{"name":"KS1 Everyday Algorithms Posters KS1 Twinkl","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.rbp8y4I0xlxGs7QyT4KMkAHaDt?r=0&pid=Api","datePublished":"2022-12-16T09:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://images.twinkl.co.uk/tw1n/image/private/t_630_eco/image_repo/92/77/t-i-1664530451-ks1-everyday-algorithms-posters_ver_2.jpg","hostPageUrl":"https://www.twinkl.co.in/resource/ks1-everyday-algorithms-posters-t-i-1664530451","contentSize":"61698 B","width":630,"height":315,"cDNContentUrl":"https://th.bing.com/th/id/R.adba7ccb8234c65c46b3b4324f828c90?rik=3pxZY6piFeZroQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"03280AF519FC6548C0AAA16BE61562AA63599CDE","accentColor":"1882B3"},"D2B21CEE1260A66F9E3367AA2CC28CC78DAECE98":{"name":"A-01/C-01/T-01","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.Krs285slEWi7To4TpXjYHQAAAA?r=0&pid=Api","datePublished":"2020-12-11T05:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://iete-elan.ac.in/SolQP/ac_10_typs_08_files/image441.jpg","hostPageUrl":"http://iete-elan.ac.in/SolQP/ac_10_typs_08.htm","contentSize":"11239 B","width":372,"height":275,"cDNContentUrl":"https://th.bing.com/th/id/R.2abb36f39b251168bb4e8e13a578d81d?rik=LSvB7iEGavbpMw&riu=http%3a%2f%2fiete-elan.ac.in%2fSolQP%2fac_10_typs_08_files%2fimage441.jpg&ehk=uJFGCsq%2bU2CicwQt8jh1py3vy%2fxwt4M5ayUuDLR7y0k%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"89ECEAD87CC82CC2AA7633E9F66A0621EEC12B2D","accentColor":"3D3D3D"},"CED0BA11F2D253501516128680F4F43DA8B923D4":{"name":"Banker's algorithm example solutions for exercise 1 - Studocu","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.zgcruUTR5OaXA8XcGSBD6QAAAA?r=0&pid=Api","datePublished":"2025-04-16T05:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/2a76e5dac05e1ef40d897dcb326dfc1a/thumb_300_424.png","hostPageUrl":"https://www.studocu.com/in/document/sns-college-of-technology/big-data-analytics/bankers-algorithm-example-solutions-for-exercise-1/123910442","contentSize":"26695 B","width":300,"height":424,"cDNContentUrl":"https://th.bing.com/th/id/R.ce072bb944d1e4e69703c5dc192043e9?rik=7A2rES8tNQVRYQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4D329B8AD34F4F086821615105352D2F11AB0DEC","accentColor":"3E3E3E"},"0C3825434EA720AD6E452FDD0A42B46398FC8E3B":{"name":"Grade R Coding Worksheet: Safari (CAPS Aligned)","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.NMEHWDDmqLE1w-ZIDHuQUwAAAA?r=0&pid=Api","datePublished":"2024-03-01T11:25:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://images.twinkl.co.uk/tw1n/image/private/t_630_eco/image_repo/27/4c/za-nst-1708587506-grade-r-robotics-and-coding-algorithms-safari_ver_1.jpg","hostPageUrl":"https://www.twinkl.co.in/resource/grade-r-robotics-and-coding-algorithms-safari-za-nst-1708587506","contentSize":"32232 B","width":474,"height":237,"cDNContentUrl":"https://th.bing.com/th/id/R.34c1075830e6a8b135c3e6480c7b9053?rik=wINSNOR6AtrmVA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B3E8CF89364B24A0DDF254E6DA027AE4345283C0","accentColor":"0E5D2D"},"1B9C4129ADE7A4C8F3E0E15F468A01AD1748C467":{"name":"AOA Assignment 2 Solved Notes (AIML 3rd Sem) - Key Concepts & Solutions ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.qKfSwKLTxfodwj4zh_OUEQHaEK?r=0&pid=Api","datePublished":"2025-11-14T02:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/bdf22519d79e9402168541dc19fa7d45/thumb_784_441.png","hostPageUrl":"https://www.studocu.com/in/document/devanga-sangha-first-grade-college/management-accounting/aoa-assignment-2-solved-notes-aiml-3rd-sem-key-concepts-solutions/145078129","contentSize":"35070 B","width":784,"height":441,"cDNContentUrl":"https://th.bing.com/th/id/R.a8a7d2c0a2d3c5fa1dc23e3387f39411?rik=sckUktp%2bSow%2fDg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"764C8471DA10A864F51E0E3F8C4A7EDA9214C9B1","accentColor":"414141"},"96B9B5306A11437D9699DB58C41BFF371428DBCE":{"name":"Operations 1: Understanding Computer Instruction Execution - Studocu","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.uqB5ixXKP-eKUsPstSXiXAHaFP?r=0&pid=Api","datePublished":"2025-09-13T21:38:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://website-assets.studocu.com/img/document_thumbnails/a6a06763d9c269a47718352f44cec729/thumb_1200_849.png","hostPageUrl":"https://www.studocu.com/in/document/indian-institute-of-technology-delhi/software-fundamentals-for-computer-technology/operations-1-understanding-computer-instruction-execution/138300501","contentSize":"126728 B","width":1200,"height":849,"cDNContentUrl":"https://th.bing.com/th/id/R.baa0798b15ca3fe78a52c3ecb525e25c?rik=aZtbA6YRNNdpmQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"ECBD824173FFB14C85BD9969D73411A6035B9B69","accentColor":"7D644E"},"B789D04BACC879C9C5E4B7FBD47E1B162E624DEB":{"name":"Graph Theory - Course","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.zxAJ93daylSInuLGEEC9IQAAAA?r=0&pid=Api","datePublished":"2024-05-13T01:27:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://storage.googleapis.com/swayam-node2-production.appspot.com/instructor/assets/i_5263.png","hostPageUrl":"https://onlinecourses.swayam2.ac.in/cec24_ma12/preview","contentSize":"27561 B","width":98,"height":134,"cDNContentUrl":"https://th.bing.com/th/id/R.cf1009f7775aca54889ee2c61040bd21?rik=e5gNtMqMl5xcTg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"BED426E261B1E74DBF7B4E5C9C978CCAB40D987B","accentColor":"9C2F32"},"96C7AC8DCDB2293C30BDD4A7B38361B2E2B5DDC8":{"name":"Google hiring tips: Interviewer shares commonly asked topics that can ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.SVbXUiFES6Hoh6lMZ6oAswHaFj?r=0&pid=Api","datePublished":"2025-03-17T17:27:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://img-s-msn-com.akamaized.net/tenant/amp/entityid/AA1B6aIu.img?w=1200&h=900&m=4&q=65","hostPageUrl":"https://www.msn.com/en-in/money/news/google-hiring-tips-interviewer-shares-commonly-asked-topics-that-can-make-or-break-your-interview/ar-AA1B6miP","contentSize":"131072 B","width":1200,"height":900,"cDNContentUrl":"https://th.bing.com/th/id/R.4956d75221444ba1e887a94c67aa00b3?rik=aXzK2NwrksMD2w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"8CDD5B2E2B16383B7A4DDB03C3922BDCD8CA7C69","accentColor":"7C6441"},"057E2D633FBD5A55268A6EB44BC643732C52F93C":{"name":"Course Page - IIT Madras Degree Program","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.nkQ4w16QlnXPCmBWyXbNVgAAAA?r=0&pid=Api","datePublished":"2023-06-19T16:11:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://study.iitm.ac.in/ds/assets/img/academics/instructors/9001_2x.jpg","hostPageUrl":"https://study.iitm.ac.in/ds/course_pages/BSMA1001.html","contentSize":"56550 B","width":200,"height":200,"cDNContentUrl":"https://th.bing.com/th/id/R.9e4438c35e909675cf0a6056c976cd56?rik=UOfSNvPbpVViqA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C39F25C237346CB44BE6A86255A5DBF336D2E750","accentColor":"379490"},"A776BA1B800857CD9BC246A377B2D45C5F85CD80":{"name":"Introduction to Graph - Data Structures Tutorial | Study Glance","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.bbDTVqAJotx7VpKHaMrWhgHaCz?r=0&pid=Api","datePublished":"2023-12-21T01:23:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://studyglance.in/ds/images/Types-of-graphs.jpg","hostPageUrl":"https://studyglance.in/ds/display.php?tno=32&topic=Introduction-to-Graph","contentSize":"721264 B","width":2482,"height":942,"cDNContentUrl":"https://th.bing.com/th/id/R.6db0d356a009a2dc7b56928768cad686?rik=emersQiAddy5LA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"08DC58F5C54D2B773A642CB9DC758008B1AB677A","accentColor":"227DA9"},"4B46EFC1ED9DA7681D570E9C12D58AA5E7578367":{"name":"Flowchart Algorithm","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.kkNTfl5RfVg4wHwLLSORCwAAAA?r=0&pid=Api","datePublished":"2020-12-12T16:46:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://vedveethi.co.in/PrincipleOfCLang/Algorithm%20and%20Flowchart_files/image003.jpg","hostPageUrl":"https://vedveethi.co.in/PrincipleOfCLang/Algorithm%20and%20Flowchart.htm","contentSize":"16053 B","width":436,"height":633,"cDNContentUrl":"https://th.bing.com/th/id/R.9243537e5e517d5838c07c0b2d23910b?rik=tGT%2bHN7ZeobRdQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7638757E5AA85D21C9E075D1867AD9DE1CFE64B4","accentColor":"5F4E44"},"CCDF26DEA13E2169E1E6C2BBE0E8494EA7B11E6B":{"name":"Introduction to Algorithms","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP._nMSRyzARxjqDu6gR2ACYQHaIb?r=0&pid=Api","datePublished":"2022-08-02T02:29:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://m.media-amazon.com/images/I/61Mw06x2XcL._SL1500_.jpg","hostPageUrl":"https://www.amazon.in/Introduction-Algorithms-fourth-Thomas-Cormen/dp/026204630X","contentSize":"83942 B","width":1317,"height":1500,"cDNContentUrl":"https://th.bing.com/th/id/R.fe7312472cc04718ea0eeea047600261?rik=zP1i7RrjEpYebg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B6E11B7AE4948E0EBB2C6E1E9612E31AED62FDCC","accentColor":"004D86"},"8707E6F71C8525EE42B79BA30E1D2570BF52DB5A":{"name":"Data structures & Algorithms","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.3Cve54FVKjQg_NNBmHQU0gHaDX?r=0&pid=Api","datePublished":"2024-10-02T15:28:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://devacomputerscience.in/images/mail_img.png","hostPageUrl":"https://devacomputerscience.in/","contentSize":"48667 B","width":1232,"height":559,"cDNContentUrl":"https://th.bing.com/th/id/R.dc2bdee781552a3420fcd341987414d2?rik=eHBuf8FYUu4kew&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A5BD25FB0752D1E03AB97B24EE5258C17F6E7078","accentColor":"CC9A00"},"3A3A54B6D7F5DDA595201B252F43A188B9F7BE0E":{"name":"Consider the following snapshot of a system: Process Maximum A B ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.7XLMSCmWx6v9jTIGmz0atAHaHf?r=0&pid=Api","datePublished":"2023-01-15T14:09:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d47/ebe42650daf2271223818dae14eca443.jpg","hostPageUrl":"https://brainly.in/question/54687266","contentSize":"570017 B","width":1865,"height":1888,"cDNContentUrl":"https://th.bing.com/th/id/R.ed72cc482996c7abfd8d32069b3d1ab4?rik=o6NFa31f3VpZAg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E0EB7F9B881A34F252B102595ADD5F7D6B45A3A3","accentColor":"292C39"},"125C195250047AE34B5857AB41AAB7587EA001BE":{"name":"Faculty Blogs","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.nCQ0W0pG7aX2G4abaJiZmQHaDs?r=0&pid=Api","datePublished":"2023-02-02T23:26:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://cdn.programiz.com/sites/tutorial2program/files/Bellman-Ford-Algorithm-2.png","hostPageUrl":"https://marwaricollegeranchi.ac.in/FacultyBlogDetails.aspx?pid=Bachelor%20of%20Science%20in%20Computer%20Application&rid=prasadanjana23@gmail.com&bid=182","contentSize":"89541 B","width":1460,"height":728,"cDNContentUrl":"https://th.bing.com/th/id/R.9c24345b4a46eda5f61b869b68989999?rik=IcWRJQVApz60hQ&pid=ImgRaw&r=0","isTransparent":true,"imageId":"EB100AE7857BAA14BA7585B43EA740052591C521","accentColor":"6209C2"}},"relatedSearches":[{"text":"Kruskal","displayText":"Kruskal","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5815.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"MST Graph","displayText":"MST Graph","webSearchUrl":"https://www.bing.com/images/search?q=MST+Graph&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5817.1","searchLink":"https://www.bing.com/api/v7/images/search?q=MST+Graph","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=MST+Graph&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Dijkstra's Algorithm Example","displayText":"Dijkstra's Algorithm Example","webSearchUrl":"https://www.bing.com/images/search?q=Dijkstra%27s+Algorithm+Example&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5819.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Dijkstra%27s+Algorithm+Example","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Dijkstra%27s+Algorithm+Example&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Dijkstra's Algorithm Animation","displayText":"Dijkstra's Algorithm Animation","webSearchUrl":"https://www.bing.com/images/search?q=Dijkstra%27s+Algorithm+Animation&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5821.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Dijkstra%27s+Algorithm+Animation","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Dijkstra%27s+Algorithm+Animation&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Minimum Spanning-Tree Example","displayText":"Minimum Spanning-Tree Example","webSearchUrl":"https://www.bing.com/images/search?q=Minimum+Spanning-Tree+Example&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5823.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Minimum+Spanning-Tree+Example","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Minimum+Spanning-Tree+Example&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Algoritma Kruskal","displayText":"Algoritma Kruskal","webSearchUrl":"https://www.bing.com/images/search?q=Algoritma+Kruskal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5825.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Algoritma+Kruskal","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Algoritma+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Computer Algorithm Examples","displayText":"Computer Algorithm Examples","webSearchUrl":"https://www.bing.com/images/search?q=Computer+Algorithm+Examples&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5827.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Computer+Algorithm+Examples","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Computer+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Diagram","displayText":"Kruskal Diagram","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Diagram&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5829.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Diagram","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Kruskal+Diagram&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Spanning-Tree Graph Theory","displayText":"Spanning-Tree Graph Theory","webSearchUrl":"https://www.bing.com/images/search?q=Spanning-Tree+Graph+Theory&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5831.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Spanning-Tree+Graph+Theory","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Spanning-Tree+Graph+Theory&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal's Tree Theorem","displayText":"Kruskal's Tree Theorem","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal%27s+Tree+Theorem&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5833.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal%27s+Tree+Theorem","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Kruskal%27s+Tree+Theorem&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algo","displayText":"Kruskal Algo","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algo&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5835.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algo","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Kruskal+Algo&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Prims vs Kruskal","displayText":"Prims vs Kruskal","webSearchUrl":"https://www.bing.com/images/search?q=Prims+vs+Kruskal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5837.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Prims+vs+Kruskal","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Prims+vs+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Simplest Example of Kruskal Algorithm","displayText":"Simplest Example of Kruskal Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=Simplest+Example+of+Kruskal+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5839.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Simplest+Example+of+Kruskal+Algorithm","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Simplest+Example+of+Kruskal+Algorithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Example of Kruskal Algorithm with Solution","displayText":"Example of Kruskal Algorithm with Solution","webSearchUrl":"https://www.bing.com/images/search?q=Example+of+Kruskal+Algorithm+with+Solution&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5841.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Example+of+Kruskal+Algorithm+with+Solution","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Example+of+Kruskal+Algorithm+with+Solution&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorith","displayText":"Kruskal Algorith","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorith&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5843.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorith","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Kruskal+Algorith&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Prims and Kruskal's","displayText":"Prims and Kruskal's","webSearchUrl":"https://www.bing.com/images/search?q=Prims+and+Kruskal%27s&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5845.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Prims+and+Kruskal%27s","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Prims+and+Kruskal%27s&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorithm Flowchart","displayText":"Kruskal Algorithm Flowchart","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorithm+Flowchart&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5847.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Flowchart","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Kruskal+Algorithm+Flowchart&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Minimal Spanning-Tree","displayText":"Minimal Spanning-Tree","webSearchUrl":"https://www.bing.com/images/search?q=Minimal+Spanning-Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5849.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Minimal+Spanning-Tree","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Minimal+Spanning-Tree&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Basic Algorithm Examples","displayText":"Basic Algorithm Examples","webSearchUrl":"https://www.bing.com/images/search?q=Basic+Algorithm+Examples&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5851.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Basic+Algorithm+Examples","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Basic+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Alogarithm","displayText":"Kruskal Alogarithm","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Alogarithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5853.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Alogarithm","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Kruskal+Alogarithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Algoritmo De Kruskal","displayText":"Algoritmo De Kruskal","webSearchUrl":"https://www.bing.com/images/search?q=Algoritmo+De+Kruskal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5855.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Algoritmo+De+Kruskal","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Algoritmo+De+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorithm Simple Graph Example","displayText":"Kruskal Algorithm Simple Graph Example","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorithm+Simple+Graph+Example&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5857.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Simple+Graph+Example","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Kruskal+Algorithm+Simple+Graph+Example&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Joseph Bernard Kruskal","displayText":"Joseph Bernard Kruskal","webSearchUrl":"https://www.bing.com/images/search?q=Joseph+Bernard+Kruskal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5859.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Joseph+Bernard+Kruskal","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Joseph+Bernard+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Algorithm Sample","displayText":"Algorithm Sample","webSearchUrl":"https://www.bing.com/images/search?q=Algorithm+Sample&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5861.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Algorithm+Sample","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Algorithm+Sample&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorithm Example Step by Step Matrix","displayText":"Kruskal Algorithm Example Step by Step Matrix","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorithm+Example+Step+by+Step+Matrix&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5863.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Example+Step+by+Step+Matrix","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Kruskal+Algorithm+Example+Step+by+Step+Matrix&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Give Me a Kruskal Algorithm Example Graph","displayText":"Give Me a Kruskal Algorithm Example Graph","webSearchUrl":"https://www.bing.com/images/search?q=Give+Me+a+Kruskal+Algorithm+Example+Graph&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5865.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Give+Me+a+Kruskal+Algorithm+Example+Graph","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Give+Me+a+Kruskal+Algorithm+Example+Graph&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskall","displayText":"Kruskall","webSearchUrl":"https://www.bing.com/images/search?q=Kruskall&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5867.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskall","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Kruskall&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorithm Cormen","displayText":"Kruskal Algorithm Cormen","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorithm+Cormen&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5869.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Cormen","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Kruskal+Algorithm+Cormen&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algoithm","displayText":"Kruskal Algoithm","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algoithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5871.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algoithm","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Kruskal+Algoithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Coordinates","displayText":"Kruskal Coordinates","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Coordinates&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5873.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Coordinates","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Kruskal+Coordinates&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorithm Book","displayText":"Kruskal Algorithm Book","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorithm+Book&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5875.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Book","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Kruskal+Algorithm+Book&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Java Algorithm Examples","displayText":"Java Algorithm Examples","webSearchUrl":"https://www.bing.com/images/search?q=Java+Algorithm+Examples&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5877.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Java+Algorithm+Examples","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Java+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Graph Examples for Kruskal","displayText":"Graph Examples for Kruskal","webSearchUrl":"https://www.bing.com/images/search?q=Graph+Examples+for+Kruskal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5879.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Graph+Examples+for+Kruskal","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Graph+Examples+for+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorthem","displayText":"Kruskal Algorthem","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorthem&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5881.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorthem","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Kruskal+Algorthem&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorithm Question Graph","displayText":"Kruskal Algorithm Question Graph","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorithm+Question+Graph&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5883.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Question+Graph","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Kruskal+Algorithm+Question+Graph&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorithm PNG","displayText":"Kruskal Algorithm PNG","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorithm+PNG&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5885.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+PNG","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Kruskal+Algorithm+PNG&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Solved Example","displayText":"Kruskal Solved Example","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Solved+Example&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5887.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Solved+Example","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Kruskal+Solved+Example&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Examples of Simple Algorithms","displayText":"Examples of Simple Algorithms","webSearchUrl":"https://www.bing.com/images/search?q=Examples+of+Simple+Algorithms&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5889.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Examples+of+Simple+Algorithms","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Examples+of+Simple+Algorithms&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"What Is a Spanning Tree in Graph Theory","displayText":"What Is a Spanning Tree in Graph Theory","webSearchUrl":"https://www.bing.com/images/search?q=What+Is+a+Spanning+Tree+in+Graph+Theory&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5891.1","searchLink":"https://www.bing.com/api/v7/images/search?q=What+Is+a+Spanning+Tree+in+Graph+Theory","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=What+Is+a+Spanning+Tree+in+Graph+Theory&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal Algorithm GIF","displayText":"Kruskal Algorithm GIF","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal+Algorithm+GIF&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5893.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+GIF","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Kruskal+Algorithm+GIF&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Algoritum Kruskal","displayText":"Algoritum Kruskal","webSearchUrl":"https://www.bing.com/images/search?q=Algoritum+Kruskal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5895.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Algoritum+Kruskal","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Algoritum+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Real Life Algorithm Examples","displayText":"Real Life Algorithm Examples","webSearchUrl":"https://www.bing.com/images/search?q=Real+Life+Algorithm+Examples&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5897.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Real+Life+Algorithm+Examples","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Real+Life+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Medical Algorithm Examples","displayText":"Medical Algorithm Examples","webSearchUrl":"https://www.bing.com/images/search?q=Medical+Algorithm+Examples&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5899.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Medical+Algorithm+Examples","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Medical+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Time Graph of Kruskal Algorithm","displayText":"Time Graph of Kruskal Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=Time+Graph+of+Kruskal+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5901.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Time+Graph+of+Kruskal+Algorithm","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Time+Graph+of+Kruskal+Algorithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskl Algorithm Properties Image","displayText":"Kruskl Algorithm Properties Image","webSearchUrl":"https://www.bing.com/images/search?q=Kruskl+Algorithm+Properties+Image&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5903.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskl+Algorithm+Properties+Image","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Kruskl+Algorithm+Properties+Image&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Thuật Toán Kruskal","displayText":"Thuật Toán Kruskal","webSearchUrl":"https://www.bing.com/images/search?q=Thu%E1%BA%ADt+To%C3%A1n+Kruskal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5905.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Thu%E1%BA%ADt+To%C3%A1n+Kruskal","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Thu%e1%ba%adt+To%c3%a1n+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Kruskal's Algorithm Image in Blue Background","displayText":"Kruskal's Algorithm Image in Blue Background","webSearchUrl":"https://www.bing.com/images/search?q=Kruskal%27s+Algorithm+Image+in+Blue+Background&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5907.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Kruskal%27s+Algorithm+Image+in+Blue+Background","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Kruskal%27s+Algorithm+Image+in+Blue+Background&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Prim's Algorithm Table","displayText":"Prim's Algorithm Table","webSearchUrl":"https://www.bing.com/images/search?q=Prim%27s+Algorithm+Table&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5909.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Prim%27s+Algorithm+Table","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Prim%27s+Algorithm+Table&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Flowchart for Implementation of Kruskal Algorithm","displayText":"Flowchart for Implementation of Kruskal Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=Flowchart+for+Implementation+of+Kruskal+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5911.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Flowchart+for+Implementation+of+Kruskal+Algorithm","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Flowchart+for+Implementation+of+Kruskal+Algorithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Small Examples of Kruskal's Algorithm","displayText":"Small Examples of Kruskal's Algorithm","webSearchUrl":"https://www.bing.com/images/search?q=Small+Examples+of+Kruskal%27s+Algorithm&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5913.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Small+Examples+of+Kruskal%27s+Algorithm","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Small+Examples+of+Kruskal%27s+Algorithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}}],"createdate":1777799892527}
[curl_error] =>
[product_name_used] => Kruskal-S-Algorithm-Example
[parsed] => Array
(
[name] => kruskal-s-algorithm-example inr loc:in
[totalEstimatedMatches] => 287
[nextOffset] => 120
[currentOffset] => 0
[value] => Array
(
[4BBEF84FEE7C886DD6A94A00B8277D00F032FAD2] => Array
(
[name] => Fillable Online Coumadin Dosing Algorithm For INR of 2-3 Fax Email ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Q8nyPSsxUxkBLFFs_-nsawAAAA?r=0&pid=Api
[datePublished] => 2022-08-14T15:32:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.pdffiller.com/preview/207/156/207156521.png
[hostPageUrl] => https://www.pdffiller.com/207156521-CoumadinDosingAlgorithm2pdf-Coumadin-Dosing-Algorithm-For-INR-of-2-3-
[contentSize] => 6581 B
[width] => 298
[height] => 386
[cDNContentUrl] => https://th.bing.com/th/id/R.43c9f23d2b315319012c516cffe9ec6b?rik=tOuP9O7HiNZtmg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2DAF230F00D7728B00A49A6DD688C7EEF48FEBB4
[accentColor] => 3B3B3B
)
[B7FE191C5198D660AE00A9F83240B0BEBC87C43B] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.xdkcNZwaGpZh7qkuBTdbHgHaEj?r=0&pid=Api
[datePublished] => 2021-03-25T04:08:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/kruskals-algorithm/images/kruskal.png
[hostPageUrl] => https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/kruskals-algorithm/basic-concept.html
[contentSize] => 71597 B
[width] => 882
[height] => 542
[cDNContentUrl] => https://th.bing.com/th/id/R.c5d91c359c1a1a9661eea92e05375b1e?rik=e%2b%2bRwRWJbQbqAA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B34C78CBEB0B04238F9A00EA066D8915C191EF7B
[accentColor] => 202AAB
)
[1C52B1E5F71559D5DC901A85949EA83DC2E0083A] => Array
(
[name] => 8.3.3 Kruskal's Algorithm
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.tu3YnwD1CEwcTUu1YC29HAHaIs?r=0&pid=Api
[datePublished] => 2015-04-29T13:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img430.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node184.html
[contentSize] => 13952 B
[width] => 953
[height] => 1119
[cDNContentUrl] => https://th.bing.com/th/id/R.b6edd89f00f5084c1c4d4bb5602dbd1c?rik=wSUbXn9RlV3NCQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A3800E2CD38AE94958A109CD5D95517F5E1B25C1
[accentColor] => 434343
)
[18AF8697EAE152C6FDD516A3FFF28993EEA36747] => Array
(
[name] => Kruskal Algorithm in C : Concept, Explanation & Example
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.YB9JYdEtC_wBPSlkySyZRwHaD5?r=0&pid=Api
[datePublished] => 2025-04-19T08:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/kruskal-algorithm-in-c-image-1.jpg
[hostPageUrl] => https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c
[contentSize] => 156879 B
[width] => 1432
[height] => 754
[cDNContentUrl] => https://th.bing.com/th/id/R.601f4961d12d0bfc013d2964c92c9947?rik=gfpoea4eJWzfXQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 74763AEE39982FFF3A615DDF6C251EAE7968FA81
[accentColor] => 3B015F
)
[B09A89AE68710AAC408316A3FFF28993EEA36747] => Array
(
[name] => Kruskal Algorithm in C : Concept, Explanation & Example
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.zLXMqPvJ4g5BgtOpRTVLqAHaE_?r=0&pid=Api
[datePublished] => 2025-04-19T08:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/kruskal-algorithm-in-c-image-4.jpg
[hostPageUrl] => https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c
[contentSize] => 131401 B
[width] => 1120
[height] => 754
[cDNContentUrl] => https://th.bing.com/th/id/R.ccb5cca8fbc9e20e4182d3a945354ba8?rik=C6mY6oYXoMoEOA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 74763AEE39982FFF3A613804CAA01786EA98A90B
[accentColor] => 3B005F
)
[737D5725F1703F32F4E5CC97A678DF4CDABBFB0A] => Array
(
[name] => KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.zgyg6VZCQCTMO8X1i3KCjQHaIh?r=0&pid=Api
[datePublished] => 2020-09-13T18:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Kruskals1.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree.htm
[contentSize] => 88030 B
[width] => 634
[height] => 730
[cDNContentUrl] => https://th.bing.com/th/id/R.ce0ca0e956424024cc3bc5f58b72828d?rik=N9d1Uh8H8yNPXg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A0BFBBADC4FD876A79CC5E4F23F3071F5275D737
[accentColor] => C43A07
)
[571EE8D0DB044C0819D6154D0018223319668550] => Array
(
[name] => Minimum Spanning Tree - Operations, Algorithm with Example C Programs ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.mzXyP4MB240_P2eGOGpivAAAAA?r=0&pid=Api
[datePublished] => 2023-08-24T08:25:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.poriyaan.in/media/imgPori/images51/PUt4Rq1.jpg
[hostPageUrl] => https://cse.poriyaan.in/topic/minimum-spanning-tree-50557/
[contentSize] => 41405 B
[width] => 383
[height] => 747
[cDNContentUrl] => https://th.bing.com/th/id/R.9b35f23f8301db8d3f3f6786386a62bc?rik=deGODb1AxICRbQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0558669133228100D4516D9180C440BD0D8EE175
[accentColor] => 5F646C
)
[475312664A19423B184E154D0018223319668550] => Array
(
[name] => Minimum Spanning Tree - Operations, Algorithm with Example C Programs ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.wDOjlQIOE1bIeYlGyAOtZgAAAA?r=0&pid=Api
[datePublished] => 2023-08-24T08:25:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.poriyaan.in/media/imgPori/images51/yCIMxME.jpg
[hostPageUrl] => https://cse.poriyaan.in/topic/minimum-spanning-tree-50557/
[contentSize] => 14522 B
[width] => 263
[height] => 233
[cDNContentUrl] => https://th.bing.com/th/id/R.c033a395020e1356c8798946c803ad66?rik=dDUhZqSRJLOB5A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0558669133228100D451E481B32491A466213574
[accentColor] => 61636A
)
[9A143FD14131B889D4606C482376ABCBD017378F] => Array
(
[name] => 27) Find Minimum Spanning Tree for the given graph using Kruskal's ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.dirPaWjstGXoTRS8spOttwHaCf?r=0&pid=Api
[datePublished] => 2023-11-19T08:44:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/da5/ef1a5c73b85c755dbc9d2bbcee7319cf.jpg
[hostPageUrl] => https://brainly.in/question/58738214
[contentSize] => 15504 B
[width] => 882
[height] => 297
[cDNContentUrl] => https://th.bing.com/th/id/R.762acf6968ecb465e84d14bcb293adb7?rik=qUHzHRQTi5hNBg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F873710DBCBA673284C6064D988B13141DF341A9
[accentColor] => 725A59
)
[EF80BDC71939E7CB553DC2B1422920561274E94F] => Array
(
[name] => Kruskal’s Algorithm: Minimum Cost Spanning Tree - 2 Video Lecture ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.21-LmWW0ywN2TiA5WfmKQwHaFj?r=0&pid=Api
[datePublished] => 2023-11-22T14:17:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://img.youtube.com/vi/MPeS-vf5FW0/0.jpg
[hostPageUrl] => https://edurev.in/v/318573/Mastering-Kruskal%E2%80%99s-Algorithm-Minimum-Cost-Spanning-Tree-Explained-PART-2-GATE-COMPUTER-SCIENCE
[contentSize] => 10698 B
[width] => 480
[height] => 360
[cDNContentUrl] => https://th.bing.com/th/id/R.db5f8b9965b4cb03764e203959f98a43?rik=%2fgjbfJGTfrxV0w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F49E4721650292241B2CD355BC7E93917CDB08FE
[accentColor] => C60507
)
[C45C758C302F5BD4F0C36ABECA7FA0C1081C446C] => Array
(
[name] => Which of the following edges form minimum spanning tree on the graph ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.akKMzxTgd1MACNlHaiEHVgHaGX?r=0&pid=Api
[datePublished] => 2020-03-19T06:09:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d91/5a0967e91e7a017712a72dc83bcf439d.jpg
[hostPageUrl] => https://brainly.in/question/16057730
[contentSize] => 66829 B
[width] => 875
[height] => 752
[cDNContentUrl] => https://th.bing.com/th/id/R.6a428ccf14e077530008d9476a210756?rik=TMVXyAPytU0PPA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C644C1801C0AF7ACEBA63C0F4DB5F203C857C54C
[accentColor] => 1675B3
)
[3FC3B70A87E3D58AAD7A0CBAD2F01953652E7AF5] => Array
(
[name] => Minimum Cost Spanini tree using Kruskal's Algorithm. - Brainly.in
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.BHl0L-5iCeSylauBdFTHWQHaFr?r=0&pid=Api
[datePublished] => 2024-12-20T17:47:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d73/e6b70576befad3489a5ed2e805c1a72d.jpg
[hostPageUrl] => https://brainly.in/question/61539413
[contentSize] => 23093 B
[width] => 825
[height] => 633
[cDNContentUrl] => https://th.bing.com/th/id/R.0479742fee6209e4b295ab817454c759?rik=8zx7oHg%2bXajapw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5FA7E25635910F2DABC0A7DAA85D3E78A07B3CF3
[accentColor] => 414141
)
[A6B1EBDF377D94937197154D0018223319668550] => Array
(
[name] => Minimum Spanning Tree - Operations, Algorithm with Example C Programs ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.-HCnOhBWBlalmwFzEGNe2QHaDB?r=0&pid=Api
[datePublished] => 2023-08-24T08:25:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.poriyaan.in/media/imgPori/images51/Fru4WKH.jpg
[hostPageUrl] => https://cse.poriyaan.in/topic/minimum-spanning-tree-50557/
[contentSize] => 53023 B
[width] => 559
[height] => 228
[cDNContentUrl] => https://th.bing.com/th/id/R.f870a73a10560656a59b017310635ed9?rik=ahu%2b%2fXPXSTkXeQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0558669133228100D45179173949D773FDBE1B6A
[accentColor] => 4C567F
)
[16CEFB2F08849F648D6A193CCBC567D5C55E3F17] => Array
(
[name] => Kruskal's Algorithm Implementation in C for MST - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.M7AuL_8DUHWYMIrdcz_LqwHaKd?r=0&pid=Api
[datePublished] => 2025-12-23T06:32:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/16f48585697c6f29221556609282b00e/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/data-structures-analysis-of-algorithms/kruskals-algorithm-implementation-in-c-for-mst/149368646
[contentSize] => 98253 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.33b02e2fff03507598308add733fcbab?rik=Yey%2f8oBI%2bUbYpg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 71F3E55C5D765CBCC391A6D846F94880F2BFEC61
[accentColor] => 373737
)
[5B859148B57A9D4429DEB86C08BDB3B31E6B4659] => Array
(
[name] => MST Kruskal Example - ABC - Kruskal’s algorithm Example Example: Apply ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.CaRBpMq6Y0PJsOv9n2x84gHaKd?r=0&pid=Api
[datePublished] => 2025-03-30T10:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/64f84b4a3b7c11afdb17de73316720a5/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-mumbai/analysis-of-algorithms/mst-kruskal-example-abc/122363404
[contentSize] => 214674 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.09a441a4caba6343c9b0ebfd9f6c7ce2?rik=tVgZhFun2USS7Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9564B6E13B3BDB80C68BED9244D9A75B841958B5
[accentColor] => CC0012
)
[9E66A185BF0A0D2E24825D63A01F98A2012AB886] => Array
(
[name] => Code: A-20
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.OQo5gQRMcijDTuVYcgwgvgAAAA?r=0&pid=Api
[datePublished] => 2010-02-13T05:11:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://www.iete-elan.ac.in/QPDec08/AC06-10-D08_files/image009.jpg
[hostPageUrl] => http://iete-elan.ac.in/QPDec08/AC06-10-D08.htm
[contentSize] => 11979 B
[width] => 360
[height] => 232
[cDNContentUrl] => https://th.bing.com/th/id/R.390a3981044c7228c34ee558720c20be?rik=6WYaWPug0OJCKA&riu=http%3a%2f%2fwww.iete-elan.ac.in%2fQPDec08%2fAC06-10-D08_files%2fimage009.jpg&ehk=Hrmeq4csks7HEY2j0vz3r3MQXnkL4AHzXIZxs%2b9sVxo%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 688BA2102A89F10A36D52842E2D0A0FB581A66E9
[accentColor] => 666666
)
[F51970AE13A5D10C9F80CC97A678DF4CDABBFB0A] => Array
(
[name] => KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Z8QdarENdQ-26ALYGSf9hwHaIg?r=0&pid=Api
[datePublished] => 2020-09-13T18:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Kruskals10.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree.htm
[contentSize] => 52850 B
[width] => 636
[height] => 730
[cDNContentUrl] => https://th.bing.com/th/id/R.67c41d6ab10d750fb6e802d81927fd87?rik=X5EH6jFaHcD5CA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A0BFBBADC4FD876A79CC08F9C01D5A31EA07915F
[accentColor] => C63905
)
[114BFE7657471B8E7ECDA6E852F5BF5D0220859B] => Array
(
[name] => KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE CODE
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.aV5ZxSjfiTp8Qj76VzSEfAHaG1?r=0&pid=Api
[datePublished] => 2020-09-22T00:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/KruskasCode3.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree-Code.htm
[contentSize] => 53939 B
[width] => 658
[height] => 607
[cDNContentUrl] => https://th.bing.com/th/id/R.695e59c528df893a7c423efa5734847c?rik=EbTvZ3V0sejn3A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B9580220D5FB5F258E6ADCE7E8B1747567EFB411
[accentColor] => C63805
)
[243363CCBC7A1D77691D5DFBD3F32D0F2533C537] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.QxMwBHEHKrJ2ixpOSfdSrgHaDW?r=0&pid=Api
[datePublished] => 2021-03-25T04:08:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/prims-algorithm/images/primfinal.png
[hostPageUrl] => https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/prims-algorithm/demo-of-prims-algorithm.html
[contentSize] => 106898 B
[width] => 1231
[height] => 556
[cDNContentUrl] => https://th.bing.com/th/id/R.4313300471072ab2768b1a4e49f752ae?rik=QjM2zMun0XeW0Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 735C3352F0D23F3DBFD5D19677D1A7CBCC363342
[accentColor] => 202AAB
)
[5AEBA3BF9ADE58C01B6BCC97A678DF4CDABBFB0A] => Array
(
[name] => KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.YDvm0gj_SJakAEKI9kPoKgHaIg?r=0&pid=Api
[datePublished] => 2020-09-13T18:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Kruskals8.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree.htm
[contentSize] => 48321 B
[width] => 635
[height] => 730
[cDNContentUrl] => https://th.bing.com/th/id/R.603be6d208ff4896a4004288f643e82a?rik=pb46%2b6nthQyxtg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A0BFBBADC4FD876A79CCB6B10C85EDA9FB3ABEA5
[accentColor] => C83803
)
[335E930D81AE1F49E0187113817FC20D49D509CA] => Array
(
[name] => Algorithms: TIFR CSE 2014 | Part B | Question: 4
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.klNj-dqpJ4TuzRogaILjlwAAAA?r=0&pid=Api
[datePublished] => 2021-07-02T14:20:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=15888888460484087290
[hostPageUrl] => https://gateoverflow.in/27174/tifr-cse-2014-part-b-question-4
[contentSize] => 7552 B
[width] => 418
[height] => 292
[cDNContentUrl] => https://th.bing.com/th/id/R.925363f9daa92784eecd1a206882e397?rik=M%2bU50Bjq8ZQOgQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AC905D94D02CF7183117810E94F1EA18D039E533
[accentColor] => 232323
)
[F01B3429FB836C5C9F8789D46063BC1E0F756B03] => Array
(
[name] => Kruskal's Algorithm - Algorithms - Computer Science Engineering (CSE ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.l81ge4tGjsWoAWhw0u8V4gHaDN?r=0&pid=Api
[datePublished] => 2022-11-24T19:37:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/1611931_8cb39534-8d51-422c-a440-907634781030_lg.png
[hostPageUrl] => https://edurev.in/t/248472/Kruskal-s-Algorithm
[contentSize] => 20391 B
[width] => 600
[height] => 260
[cDNContentUrl] => https://th.bing.com/th/id/R.97cd607b8b468ec5a8016870d2ef15e2?rik=D7FDkr84xsX5eA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 30B657F0E1CB36064D9878F9C5C638BF9243B10F
[accentColor] => 00CB07
)
[B2A7E5A305D261BF8BC5519DD7BF53A24AF3510B] => Array
(
[name] => Practical no.8 Kruskal’s Algorithm - Practical no- 8 Code and analyze ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.U_Ii2RStbDTdVZRmmcGaugHaKd?r=0&pid=Api
[datePublished] => 2024-04-17T19:32:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/f332eee814f991af97a4f57036b2d3ac/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/i-k-gujral-punjab-technical-university/data-structures-laboratory/practical-no8-kruskals-algorithm/90605428
[contentSize] => 116841 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.53f222d914ad6c34dd55946699c19aba?rik=K3peOlAtFvu4XA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B0153FA42A35FB7DD9155CB8FB162D503A5E7A2B
[accentColor] => 494949
)
[DC92323CD9B34D484030D103D49D2BFCFD9D4C6A] => Array
(
[name] => Prims and Kruskal Algorithm - Prims and Kruskal Algorithm Overview Prim ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.BFYY_Yt0gxZzu71Iz9Y7PwHaJl?r=0&pid=Api
[datePublished] => 2023-03-11T15:48:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/f53681050f0b064930d60e087860e5d7/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-mumbai/mumbai-university/prims-and-kruskal-algorithm/50530599
[contentSize] => 347729 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.045618fd8b74831673bbbd48cfd63b3f?rik=zSkjw5071IQEAw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A6C4D9DFCFB2D94D301D030484D43B9DC32329CD
[accentColor] => 4F6077
)
[52B44888AD91DF38932966DFB758BE9FDDCF91B8] => Array
(
[name] => Number of Connected Components in an Undirected Graph - [LC Premium]
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.nw_1Kt8MptbegZDyUF7ooAHaDu?r=0&pid=Api
[datePublished] => 2024-12-10T08:15:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://learn.innoskrit.in/content/images/2024/02/image-1.png
[hostPageUrl] => https://learn.innoskrit.in/graph/number-of-connected-components-in-an-undirected-graph/
[contentSize] => 175391 B
[width] => 2817
[height] => 1419
[cDNContentUrl] => https://th.bing.com/th/id/R.9f0ff52adf0ca6d6de8190f2505ee8a0?rik=JUuEiNoZ%2fYM5kg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 8B19FCDDF9EB857BFD66923983FD19DA88844B25
[accentColor] => CC004E
)
[086B6BC5E33B7E249E5B16A3FFF28993EEA36747] => Array
(
[name] => Kruskal Algorithm in C : Concept, Explanation & Example
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.0V8U6uOw8MXqx3ToVxpPNgHaDS?r=0&pid=Api
[datePublished] => 2025-04-19T08:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/kruskal-algorithm-in-c-home.png
[hostPageUrl] => https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c
[contentSize] => 293091 B
[width] => 739
[height] => 328
[cDNContentUrl] => https://th.bing.com/th/id/R.d15f14eae3b0f0c5eac774e8571a4f36?rik=gLa2XD6z50LptQ&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 74763AEE39982FFF3A61B5E942E7B33E5CB6B680
[accentColor] => CC6C00
)
[6AAD30D8B88B2AE74CEE8CD1AF15BB5E1D904594] => Array
(
[name] => Kruskal's Algorithm: Understanding and Implementation Guide - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.fY-fqh4v_9JZWrc1JKC-TwHaKe?r=0&pid=Api
[datePublished] => 2023-11-28T05:41:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/143bf4a9fb90baa56bf6bc8d0c57fa36/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/bca-data-structure/kruskals-algorithm-javatpoint/77865929
[contentSize] => 503093 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.7d8f9faa1e2fffd2595ab73524a0be4f?rik=ptoDjYu4on7E7g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 495409D1E5BB51FA1DC8EEC47EA2B88B8D03DAA6
[accentColor] => 063C6D
)
[F3D4DCC03C67AF020264154D0018223319668550] => Array
(
[name] => Minimum Spanning Tree - Operations, Algorithm with Example C Programs ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.1RCkxS15nFgl6-jnzNi_eAHaSY?r=0&pid=Api
[datePublished] => 2023-08-24T08:25:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.poriyaan.in/media/imgPori/images51/kpOdWa1.jpg
[hostPageUrl] => https://cse.poriyaan.in/topic/minimum-spanning-tree-50557/
[contentSize] => 117278 B
[width] => 541
[height] => 1343
[cDNContentUrl] => https://th.bing.com/th/id/R.d510a4c52d799c5825ebe8e7ccd8bf78?rik=P03NDMN2%2biAgRg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0558669133228100D451462020FA76C30CCD4D3F
[accentColor] => 5C5C6F
)
[C472C5FD206BB4DB1C5B51B56217B10C56F43447] => Array
(
[name] => Josephus Problem & Kruskal's Algorithm Overview - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.SBOwUdPuMof43aMYBOW0HwHaJl?r=0&pid=Api
[datePublished] => 2025-12-23T21:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/d402d85128a3eca587cfcbcb7d199cc7/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/srm-institute-of-science-and-technology/data-structures-and-algorithms/josephus-problem-kruskals-algorithm-overview/149356131
[contentSize] => 68376 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.4813b051d3ee3287f8dda31804e5b41f?rik=TCdc3wK2S73BtQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 74434F65C01B71265B15B5C1BD4BB602DF5C274C
[accentColor] => 666666
)
[878CCC510A5083039A08BD280A688D4722EF7086] => Array
(
[name] => Faculty Blogs
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.48WWx7fPRXkgJ12Mglc9vgHaDG?r=0&pid=Api
[datePublished] => 2022-10-23T05:41:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://cdn.programiz.com/sites/tutorial2program/files/dj-2.png
[hostPageUrl] => https://marwaricollegeranchi.ac.in/FacultyBlogDetails.aspx?pid=Bachelor%20of%20Science%20in%20Computer%20Application&rid=prasadanjana23@gmail.com&bid=183
[contentSize] => 70715 B
[width] => 1460
[height] => 612
[cDNContentUrl] => https://th.bing.com/th/id/R.e3c596c7b7cf457920275d8c82573dbe?rik=eMjMFaAFODCpgA&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 6807FE2274D886A082DB80A9303805A015CCC878
[accentColor] => 6208C3
)
[BD49D81C638A25749BFC84DD04C5CDE760AE2C73] => Array
(
[name] => Lab Assignment 12: Implementing Kruskal's Algorithm for MST - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.5YXbftrOkHF-RGKMwul0aQHaJl?r=0&pid=Api
[datePublished] => 2025-12-27T20:38:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/d2ed94f72403fe7135766c145573fe92/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/techno-india-university-west-bengal/database-and-management-system/lab-assignment-12-implementing-kruskals-algorithm-for-mst/149708206
[contentSize] => 96495 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.e585db7edace90717e44628cc2e97469?rik=25SNwTaoUke5zw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 37C2EA067EDC5C40DD48CFB94752A836C18D94DB
[accentColor] => 3C3C3C
)
[146AFFAFD54994C0F9A4FDB0E7741F5218C5C743] => Array
(
[name] => C Sharp - Kruskal's Algorithm - Minimum Spanning Tree - Code
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.1cJUVm-wfwT1n-T5hy_bVAHaCM?r=0&pid=Api
[datePublished] => 2023-08-06T18:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/csharp/Images/C-Sharp-Kruskal's-Algorithm-Minimum-Spanning-Tree-Code12.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/csharp/C-Sharp-Kruskal's-Algorithm-Minimum-Spanning-Tree-Code.htm
[contentSize] => 17334 B
[width] => 636
[height] => 188
[cDNContentUrl] => https://th.bing.com/th/id/R.d5c254566fb07f04f59fe4f9872fdb54?rik=Qab%2f%2bl2USQyfSg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 347C5C8125F1477E0BDF4A9F0C49945DFAFFA641
[accentColor] => C73904
)
[9B81CE226658ACC5EC435DE527BCB54829896F79] => Array
(
[name] => Python - Kruskal's Algorithm Minimum Spanning Tree Code
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.VDLC7KCiiFEkmYQhCI4k6AAAAA?r=0&pid=Api
[datePublished] => 2023-08-06T18:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Images/Python-Kruskal's-Algorithm-Minimum-Spanning-Tree-Code2.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/python/Python-Kruskal's-Algorithm-Minimum-Spanning-Tree-Code.htm
[contentSize] => 9081 B
[width] => 372
[height] => 402
[cDNContentUrl] => https://th.bing.com/th/id/R.5432c2eca0a2885124998421088e24e8?rik=uRjsImaFylzONA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 97F69892845BCB725ED534CE5CCA856622EC18B9
[accentColor] => C72804
)
[64D53162D956A573844B5A1494C3A679895A32CE] => Array
(
[name] => Kruskal ALGORITHM - /Program Name: Minimum spanning tree using Kruskal ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.O1OH0wC3-6BO4MehsY0kQgHaJl?r=0&pid=Api
[datePublished] => 2024-04-11T08:34:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/4db572c4521897e02624a7708068f1ce/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/nims-university/computer-science/kruskal-algorithm/89301988
[contentSize] => 92550 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.3b5387d300b7fba04ee0c7a1b18d2442?rik=Rl0TJp1lWjdItA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => EC23A598976A3C4941A5B448375A659D26135D46
[accentColor] => 434343
)
[ECE2649B5118793BDF16A6E852F5BF5D0220859B] => Array
(
[name] => KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE CODE
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.xdVvDfn3jjmZ5QoOWpxdjgHaEi?r=0&pid=Api
[datePublished] => 2020-09-22T00:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/KruskasCode1.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree-Code.htm
[contentSize] => 38267 B
[width] => 608
[height] => 373
[cDNContentUrl] => https://th.bing.com/th/id/R.c5d56f0df9f78e3999e50a0e5a9c5d8e?rik=zi5GuRWBl7P9YQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B9580220D5FB5F258E6A61FDB3978115B9462ECE
[accentColor] => C83803
)
[FB9D5A70A682753FAEA42F8E5142397C6FB1D9C0] => Array
(
[name] => Program 9: C Implementation of Minimum Spanning Tree using Kruskal's ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.LTIfu_Y0dhl2pGpjwUakjgHaKd?r=0&pid=Api
[datePublished] => 2025-12-31T00:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/b455e8467dd6c54967cabc9127c6a6ea/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/dr-apj-abdul-kalam-technical-university/btech-cse-3rd-year/program-9-c-implementation-of-minimum-spanning-tree-using-kruskals-algorithm/149841793
[contentSize] => 115329 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.2d321fbbf634761976a46a63c146a48e?rik=v9mlB2ooV%2fPqSg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0C9D1BF6C7932415E8F24AEAF357286A07A5D9BF
[accentColor] => 454545
)
[6FFB7CB3D3C145117142FABB50CAF09E5E98C415] => Array
(
[name] => DAA: Prim's and Kruskal's Algorithms for MST Construction - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.bnGSCw1jqWHzN30qofu2hAHaEK?r=0&pid=Api
[datePublished] => 2025-11-27T07:34:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/4ce46510e18caedb4a953b4ca6b44265/thumb_784_441.png
[hostPageUrl] => https://www.studocu.com/in/document/rani-channamma-university/bachelors-of-computer-application/daa-prims-and-kruskals-algorithms-for-mst-construction/146957871
[contentSize] => 23724 B
[width] => 784
[height] => 441
[cDNContentUrl] => https://th.bing.com/th/id/R.6e71920b0d63a961f3377d2aa1fbb684?rik=9r%2fHOz0cVBEXJA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 514C89E5E90FAC05BBAF241711541C3D3BC7BFF6
[accentColor] => 373737
)
[FA222BF8F58BD9E4A44C89D46063BC1E0F756B03] => Array
(
[name] => Kruskal's Algorithm - Algorithms - Computer Science Engineering (CSE ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.tMsMEDM-eLF-q39KjjxtGAAAAA?r=0&pid=Api
[datePublished] => 2022-11-24T19:37:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/1611931_23473e9e-c641-43e8-aaac-bffdbba6154e_lg.png
[hostPageUrl] => https://edurev.in/t/248472/Kruskal-s-Algorithm
[contentSize] => 5738 B
[width] => 278
[height] => 250
[cDNContentUrl] => https://th.bing.com/th/id/R.b4cb0c10333e78b17eab7f4a8e3c6d18?rik=ryKyj1%2b4nU5KxA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 30B657F0E1CB36064D98C44A4E9DB85F8FB222AF
[accentColor] => 01CA0A
)
[2D7117EA03F4CCC5C5A8290B65F516D9CAECEAAA] => Array
(
[name] => Kruskal’s algorithm - Kruskal’s algorithm Kruskal’s algorithm is a ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.bivNtgYN8GoOfKZYTxFjbgHaJl?r=0&pid=Api
[datePublished] => 2023-04-04T08:53:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/edc5d90bfa4a454c079cd8fca4372060/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/nirmala-college/structured-programming-in-c/kruskals-algorithm/52845533
[contentSize] => 171804 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.6e2bcdb6060df06a0e7ca6584f11636e?rik=0hdxrjBPzFxcig&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AAAECEAC9D615F56B0928A5C5CCC4F30AE7117D2
[accentColor] => 4B4B4B
)
[8099357768C5B4A5C864D7C6AEF01B243F88BF9B] => Array
(
[name] => Kruskal algorithm - Kruskal’s algorithm is a greedy algorithm for ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.5pf4zOs6ikcVvVEapod33QHaKe?r=0&pid=Api
[datePublished] => 2023-03-26T17:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/ac19c64cc4d0b2cc1978d783be72eeab/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/indian-institute-of-technology-roorkee/quantum-physics/kruskal-algorithm/48725170
[contentSize] => 252755 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.e697f8cceb3a8a4715bd511aa68777dd?rik=CJlTd4ZcS1qMRg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B9FB88F342B10FEA6C7D468C5A4B5C8677539908
[accentColor] => 666666
)
[2D8DD62AA3CAF60F1DBA9D747346A3C24E441167] => Array
(
[name] => 8.3.2 Prim's Algorithm
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.M_3T1CI4E0huWl5oqsr0LwHaF-?r=0&pid=Api
[datePublished] => 2018-04-02T13:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img425.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node183.html
[contentSize] => 9456 B
[width] => 1033
[height] => 833
[cDNContentUrl] => https://th.bing.com/th/id/R.33fdd3d4223813486e5a5e68aacaf42f?rik=0thtojqsb%2fDRqw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 761144E42C3A643747D9ABD1F06FAC3AA26DD8D2
[accentColor] => 474747
)
[379CFAD34B3A0A52B9EC2391F35AFD01681F1F05] => Array
(
[name] => Minimum Spanning Tree Experiment No 7: Prim's and Kruskal's Algorithms ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.DMfxAimixHCvuA8Rw9HK-AHaKd?r=0&pid=Api
[datePublished] => 2024-11-02T07:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/8763ff0253b1cf7631e1f59a68b46e1d/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/practical-no-7/109406852
[contentSize] => 335725 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.0cc7f10229a2c470afb80f11c3d1caf8?rik=c8mvPbSjoCWbzg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 50F1F18610DFA53F1932CE9B25A0A3B43DAFC973
[accentColor] => 7C0232
)
[781143FE2705CCD001371A85949EA83DC2E0083A] => Array
(
[name] => 8.3.3 Kruskal's Algorithm
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Wh0r27tUNoq8BSU5rD9YsgAAAA?r=0&pid=Api
[datePublished] => 2015-04-29T13:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img422.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node184.html
[contentSize] => 224 B
[width] => 20
[height] => 45
[cDNContentUrl] => https://th.bing.com/th/id/R.5a1d2bdbbb54368abc052539ac3f58b2?rik=hxE073JQzA0Qcw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A3800E2CD38AE94958A173100DCC5072EF341187
[accentColor] => 666666
)
[945C5D1114753304DE36FA69A8B58B50B2374BA7] => Array
(
[name] => Algorithms: Do Prim’s and Kruskal’s algorithms still work if the edge ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.n8yFy0yAcYqy3VzUWip3ngAAAA?r=0&pid=Api
[datePublished] => 2015-10-13T16:52:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=8674054686674281952
[hostPageUrl] => https://gateoverflow.in/19537/prims-kruskals-algorithms-still-weights-allowed-negative
[contentSize] => 4490 B
[width] => 233
[height] => 216
[cDNContentUrl] => https://th.bing.com/th/id/R.9fcc85cb4c80718ab2dd5cd45a2a779e?rik=ScXVEUFXM0DtYw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7AB4732B05B85B8A96AF63ED4033574111D5C549
[accentColor] => 545956
)
[7BA373FC179BB043E3CFF6EA5F4D05FD1FF32CCB] => Array
(
[name] => Entry #6 by ceesjandronkers for Custom Prim's and Kruskal's Algorithms ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.cfpXkfJfyJyZsiPUMCo5fwHaEn?r=0&pid=Api
[datePublished] => 2023-06-12T00:06:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://cdn3.f-cdn.com/contestentries/1910199/53783617/605910018fe13_thumb900.jpg
[hostPageUrl] => https://www.freelancer.in/contest/custom-prims-and-kruskals-algorithms-1910199-byentry-50500857
[contentSize] => 23739 B
[width] => 900
[height] => 562
[cDNContentUrl] => https://th.bing.com/th/id/R.71fa5791f25fc89c99b223d4302a397f?rik=tzo3z3G5CzQ%2b%2fA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => BCC23FF1DF50D4F5AE6FFC3E340BB971CF373AB7
[accentColor] => BF0C0E
)
[52C62791926332B8471980DD23D1F3FFB91C5FFB] => Array
(
[name] => Aad-part11 - Lecture notes 11 - Kruskal’s Algorithm Kruskal's algorithm ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.fphOMOGM6H7RG92oPQUAgAHaJl?r=0&pid=Api
[datePublished] => 2022-03-05T20:25:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/1b67487c2333853c274cade55fc6a881/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/algorithm-analysis-and-design/aad-part11-lecture-notes-11/22295457
[contentSize] => 133607 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.7e984e30e18ce87ed11bdda83d050080?rik=JWxyGSk2I4t0kQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => BFF5C19BFF3F1D32DD0891748B23362919726C25
[accentColor] => 474747
)
[0B967AFAD4FFC2035BE5E193EF9A93CFCF3BF155] => Array
(
[name] => Kruskal’s Algorithm: Minimum Cost Spanning Tree - 1 Video Lecture ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.UJ-lzqByAbzGIEtWMsNdkwHaFj?r=0&pid=Api
[datePublished] => 2023-11-22T14:17:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://img.youtube.com/vi/wJ5RPCarrlI/0.jpg
[hostPageUrl] => https://edurev.in/v/318572/Mastering-Kruskal%E2%80%99s-Algorithm-Minimum-Cost-Spanning-Tree-Explained-PART-1-GATE-COMPUTER-SCIENCE
[contentSize] => 12071 B
[width] => 480
[height] => 360
[cDNContentUrl] => https://th.bing.com/th/id/R.509fa5cea07201bcc6204b5632c35d93?rik=sGmnr03%2fLDC1Xg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 551FB3FCFC39A9FE391E5EB5302CFF4DAFA769B0
[accentColor] => C50607
)
[AB6E8C2825E6C60B1361D2A00833009A8F902857] => Array
(
[name] => Algorithms: #Algorithms How is this equivalent in Kruskal's Algorithm's ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.r_EQj6cWmioOpmnjqK7HnAHaJ5?r=0&pid=Api
[datePublished] => 2018-05-12T23:54:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=10251424452337358031
[hostPageUrl] => https://gateoverflow.in/213053/%23algorithms-this-equivalent-kruskals-algorithms-complexity
[contentSize] => 73285 B
[width] => 600
[height] => 802
[cDNContentUrl] => https://th.bing.com/th/id/R.aff1108fa7169a2a0ea669e3a8aec79c?rik=uubIglJubLAxFg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 758209F8A90033800A2D1631B06C6E5282C8E6BA
[accentColor] => 576274
)
[DE4EF6153515245439481A85949EA83DC2E0083A] => Array
(
[name] => 8.3.3 Kruskal's Algorithm
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.QoBu5vFnIU_daQxu1C71uwAAAA?r=0&pid=Api
[datePublished] => 2015-04-29T13:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img68.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node184.html
[contentSize] => 161 B
[width] => 22
[height] => 42
[cDNContentUrl] => https://th.bing.com/th/id/R.42806ee6f167214fdd690c6ed42ef5bb?rik=7eRvUVNRQkWThA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A3800E2CD38AE94958A1849345425153516FE4ED
[accentColor] => 0E0E0E
)
[017A90A8C3DE3F46FC9F520F56E63EED73342639] => Array
(
[name] => Module 3 - Greedy algorithm ,Knapsack algorithm and Kruskal's algorithm ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.AMzffImwHzLqMMtBuMPj0AHaJl?r=0&pid=Api
[datePublished] => 2022-07-03T18:55:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/4858075312687e549b10e7a11c8d9c1a/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/mahatma-gandhi-university/analysis-design-of-algorithms/module-3-greedy-algorithm-knapsack-algorithm-and-kruskals-algorithm/29825740
[contentSize] => 305061 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.00ccdf7c89b01f32ea30cb41b8c3e3d0?rik=EKcJijzt82TP%2bQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 93624337DEE36E65F025F9CF64F3ED3C8A09A710
[accentColor] => B61515
)
[AAEE7F74208211C54E649F324DAF6C41E0EAB590] => Array
(
[name] => SE&PM -notes(BCS501) - Software engineering module 1 notes - Navkis ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.SdOo7OG8FbHbwXQ9WVmqBgHaKd?r=0&pid=Api
[datePublished] => 2024-10-30T00:17:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/b7d1fa1a4c3b616f076c2e517a457a68/thumb_1200_1696.webp
[hostPageUrl] => https://www.studocu.com/in/document/visvesvaraya-technological-university/cse/sepm-notesbcs501-software-engineering-module-1-notes/109054976
[contentSize] => 59854 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.49d3a8ece1bc15b1dbc1743d5959aa06?rik=qu73RwIoEVzkRg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 095BAE0E14C6FAD423F946E45C11280247F7EEAA
[accentColor] => 666566
)
[8974767D99D38744BC7B36F3C573C1ED41CDE0C6] => Array
(
[name] => Kruskal - Fghbhbbh - Kruskal's algorithm is a greedy algorithm used to ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.LPGhTtWL8Bx0wFxIm1auCQAAAA?r=0&pid=Api
[datePublished] => 2024-02-05T00:37:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/26494135f27a529fb5a0a30c4c466818/thumb_300_425.png
[hostPageUrl] => https://www.studocu.com/in/document/annai-meenakshi-college-of-education/mechanical-engineering/kruskal-fghbhbbh/80571563
[contentSize] => 26918 B
[width] => 300
[height] => 425
[cDNContentUrl] => https://th.bing.com/th/id/R.2cf1a14ed58bf01c74c05c489b56ae09?rik=mEdn15k9eETLtw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 6C0EDC14DE1C375C3F63B7CB44783D99D7674798
[accentColor] => 374E5E
)
[F17B8AE697E7E772F5CEFE1BDCE68FE3B6CE1B77] => Array
(
[name] => Explain the working of the Prim’s algorithm with suitable example ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.xttyICt5YzT0dCQ48UMi1gHaHq?r=0&pid=Api
[datePublished] => 2022-12-13T01:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://gtu-paper-solution.com/upload/2130702/S2019/Prims_Algorithm.png
[hostPageUrl] => https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2019/Question-3-c
[contentSize] => 71322 B
[width] => 619
[height] => 640
[cDNContentUrl] => https://th.bing.com/th/id/R.c6db72202b796334f4742438f14322d6?rik=H7eobnl%2bfidf7A&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fPrims_Algorithm.png&ehk=R3XVBQbOf%2flcL1i52jsbgXMD%2bElBkWu4rjUxNhYILIQ%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 77B1EC6B3EF86ECDB1EFEC5F277E7E796EA8B71F
[accentColor] => 654934
)
[116B4A348F5956866B4831E19ED500A136B434D9] => Array
(
[name] => Algorithms: TIFR CSE 2014 | Part B | Question: 5
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.JlqBQBHGugfaMZqjJF7hsAAAAA?r=0&pid=Api
[datePublished] => 2021-07-07T10:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=7905451498867938326
[hostPageUrl] => https://gateoverflow.in/27180/tifr-cse-2014-part-b-question-5
[contentSize] => 2253 B
[width] => 119
[height] => 127
[cDNContentUrl] => https://th.bing.com/th/id/R.265a814011c6ba07da319aa3245ee1b0?rik=EbakQ%2fiVZWi2hA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9D434B631A005DE91E1384B6686595F843A4B611
[accentColor] => 666666
)
[E00204E03D04DBDF7D43572265A7F3DB5A70EDF5] => Array
(
[name] => Binary Trees - HPTU Exam Helper
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.RI0WGsCUQbiBdzsoktxQ7AHaFu?r=0&pid=Api
[datePublished] => 2025-05-26T01:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://res.cloudinary.com/hptuexamhelper/image/upload/f_auto,q_auto/HT3_i2td9k.png
[hostPageUrl] => https://www.hptuexamhelper.in/theory/cse/semester_iii/data_structures_and_algo/unit_iii/binary_trees
[contentSize] => 26427 B
[width] => 663
[height] => 512
[cDNContentUrl] => https://th.bing.com/th/id/R.448d161ac09441b881773b2892dc50ec?rik=DiBADtNAvf3XNA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5FDE07A5BD3F7A56227534D7FDBD40D30E40200E
[accentColor] => 02C702
)
[70437C7F946E95E069E716A3FFF28993EEA36747] => Array
(
[name] => Kruskal Algorithm in C : Concept, Explanation & Example
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.vTDqtkPOoSHFh1U2Z0cYZQAAAA?r=0&pid=Api
[datePublished] => 2025-04-19T08:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d14qv6cm1t62pm.cloudfront.net/ccbp-website/Blogs/home/kruskal-algorithm-in-c-image-2.jpg
[hostPageUrl] => https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c
[contentSize] => 57737 B
[width] => 328
[height] => 754
[cDNContentUrl] => https://th.bing.com/th/id/R.bd30eab643cea121c587553667471865?rik=BzTH90nmWQ6Wfg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 74763AEE39982FFF3A617E960E59E649F7C73407
[accentColor] => 3B015F
)
[CFAEC3BAE20EFD532E82CC97A678DF4CDABBFB0A] => Array
(
[name] => KRUSKAL's ALGORITHM - MINIMUM SPANNING TREE
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.1_cpHnPgLqCOMDqLkld93gHaIS?r=0&pid=Api
[datePublished] => 2020-09-13T18:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Kruskals9.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Kruskal's-Algorithm-Minimum-Spanning-Tree.htm
[contentSize] => 50472 B
[width] => 660
[height] => 739
[cDNContentUrl] => https://th.bing.com/th/id/R.d7f7291e73e02ea08e303a8b92577dde?rik=%2fOo8qy7g3zXiKA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A0BFBBADC4FD876A79CC28E235DFE02EAB3CEAFC
[accentColor] => C73904
)
[042377BAA4E3777BC90B31E19ED500A136B434D9] => Array
(
[name] => Algorithms: TIFR CSE 2014 | Part B | Question: 5
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.b1ii6zA9dE0DknB4xHbBjgAAAA?r=0&pid=Api
[datePublished] => 2021-07-07T10:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=9376175615755442996
[hostPageUrl] => https://gateoverflow.in/27180/tifr-cse-2014-part-b-question-5
[contentSize] => 2129 B
[width] => 121
[height] => 113
[cDNContentUrl] => https://th.bing.com/th/id/R.6f58a2eb303d744d03927078c476c18e?rik=QDJ3q0o%2bd7ecsA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9D434B631A005DE91E13B09CB7773E4AAB773240
[accentColor] => 666666
)
[F7794D1EA9B6D6D038E8D2A00833009A8F902857] => Array
(
[name] => Algorithms: #Algorithms How is this equivalent in Kruskal's Algorithm's ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.zfnjinbuySjVM1Xtb-GuvgHaIz?r=0&pid=Api
[datePublished] => 2018-05-12T23:54:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=3085354313699198706
[hostPageUrl] => https://gateoverflow.in/213053/%23algorithms-this-equivalent-kruskals-algorithms-complexity
[contentSize] => 64062 B
[width] => 600
[height] => 713
[cDNContentUrl] => https://th.bing.com/th/id/R.cdf9e38a76eec928d53355ed6fe1aebe?rik=f5fU4ZprbQ2Djg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 758209F8A90033800A2D8E830D6D6B9AE1D4977F
[accentColor] => 484F5B
)
[F0A78B6448CA95A4D7703B1C8E0750194A97B097] => Array
(
[name] => Surrounded Regions
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP._3-E47Ak3ByzlFThlNNdeQHaDi?r=0&pid=Api
[datePublished] => 2024-01-26T01:41:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://learn.innoskrit.in/content/images/size/w2400/2024/01/image-1.png
[hostPageUrl] => https://learn.innoskrit.in/graph/surrounded-regions/
[contentSize] => 140106 B
[width] => 2890
[height] => 1384
[cDNContentUrl] => https://th.bing.com/th/id/R.ff7f84e3b024dc1cb39454e194d35d79?rik=D3q4RoSsWUp9Bw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 790B79A4910570E8C1B3077D4A59AC8446B87A0F
[accentColor] => C8035A
)
[F5A54F5B4D818DAF87A71A85949EA83DC2E0083A] => Array
(
[name] => 8.3.3 Kruskal's Algorithm
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.bXnJ172N2mvKdIm_f1eX7AAAAA?r=0&pid=Api
[datePublished] => 2015-04-29T13:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img320.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node184.html
[contentSize] => 168 B
[width] => 22
[height] => 21
[cDNContentUrl] => https://th.bing.com/th/id/R.6d79c9d7bd8dda6bca7489bf7f5797ec?rik=X1r0tdQY2Pp4eg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A3800E2CD38AE94958A17A78FAD818D4B5F45A5F
[accentColor] => 313131
)
[E0550D50C0C8A43FDF4466292F880FC9BC1F5A53] => Array
(
[name] => 4.5 Minimum Spanning tree - Minimum cost spanning tree: Prim’s ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.wn7ut8X-ICOWIcwUs5fNDQHaKe?r=0&pid=Api
[datePublished] => 2022-10-20T03:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/8a84a617a2abff3cc8000283f40788eb/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/chandigarh-university/daa/45-minimum-spanning-tree/36387082
[contentSize] => 301752 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.c27eeeb7c5fe20239621cc14b397cd0d?rik=DlXQBQyMSvP9RA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 35A5F1CB9CF088F2926644FDF34A8C0C05D0550E
[accentColor] => 2C699F
)
[F3B05C2680E683518106EC057D1A41CF894A91C8] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.T2FGs1SwTTbGYuA5lVX4RwHaEZ?r=0&pid=Api
[datePublished] => 2021-03-25T04:08:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/analysis-of-prims/images/comparison-graph.png
[hostPageUrl] => https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/analysis-of-prims/comparison-with-kruskals-and-others.html
[contentSize] => 12197 B
[width] => 850
[height] => 505
[cDNContentUrl] => https://th.bing.com/th/id/R.4f6146b354b04d36c662e0399555f847?rik=PwvFYghuOBUYYA&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 8C19A498FC14A1D750CE601815386E0862C50B3F
[accentColor] => BC0010
)
[64929C673231D526F918BB57AEADAD0E72CD5249] => Array
(
[name] => ENGINEERING MATHEMATICS CSE,AIML, AIDS Handwritten Notes by Renge Sir ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.vRL18d1UEf7aviz29-0RJgAAAA?r=0&pid=Api
[datePublished] => 2024-12-02T03:46:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://m.media-amazon.com/images/I/51v9tgTJWlL._SY445_SX342_QL70_ML2_.jpg
[hostPageUrl] => https://www.amazon.in/ENGINEERING-MATHEMATICS-Handwritten-Notes-Renge-ebook/dp/B0DM6D8QQ7
[contentSize] => 26509 B
[width] => 271
[height] => 445
[cDNContentUrl] => https://th.bing.com/th/id/R.bd12f5f1dd5411fedabe2cf6f7ed1126?rik=RinJdiMTXWKfgQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9425DC27E0DADAEA75BB819F625D132376C92946
[accentColor] => 997B32
)
[6913BC55F186345DC0CA6EB35305C8771EE0C4DD] => Array
(
[name] => Transportation networks
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.omVrDIv9YFI_6ceWQEsKqgHaGF?r=0&pid=Api
[datePublished] => 2016-03-13T18:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.civil.iitb.ac.in/tvm/1100_LnTse/135_lntse/plain/img17.gif
[hostPageUrl] => https://www.civil.iitb.ac.in/tvm/1100_LnTse/135_lntse/plain/plain.html
[contentSize] => 5104 B
[width] => 509
[height] => 418
[cDNContentUrl] => https://th.bing.com/th/id/R.a2656b0c8bfd60523fe9c796404b0aaa?rik=ljHLVR9oQ9UMrA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => DD4C0EE1778C50353BE6AC0CD543681F55CB3196
[accentColor] => 666666
)
[2712A04F5980120BC16431E19ED500A136B434D9] => Array
(
[name] => Algorithms: TIFR CSE 2014 | Part B | Question: 5
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.Tz7-Z5NFG8E2FlSLspQeHwAAAA?r=0&pid=Api
[datePublished] => 2021-07-07T10:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=14503789916021985865
[hostPageUrl] => https://gateoverflow.in/27180/tifr-cse-2014-part-b-question-5
[contentSize] => 1978 B
[width] => 166
[height] => 103
[cDNContentUrl] => https://th.bing.com/th/id/R.4f3efe6793451bc13616548bb2941e1f?rik=ciEK9JUIIbAcRg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9D434B631A005DE91E13461CB0210895F40A2172
[accentColor] => 666666
)
[E284CBF638C1AFDC207E16A3FFF28993EEA36747] => Array
(
[name] => Kruskal Algorithm in C : Concept, Explanation & Example
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.V9UgjO1nOMbK20F1Frs2PAAAAA?r=0&pid=Api
[datePublished] => 2025-04-19T08:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://cdn.prod.website-files.com/5fa61cbbf0d432b3230f62b1/677f5eadc1710e6acd69367b_veltech-logo.png
[hostPageUrl] => https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c
[contentSize] => 27612 B
[width] => 176
[height] => 176
[cDNContentUrl] => https://th.bing.com/th/id/R.57d5208ced6738c6cadb417516bb363c?rik=Lki8b4Mc%2bs0C5w&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 74763AEE39982FFF3A61E702CDFA1C836FBC482E
[accentColor] => A60204
)
[57EE0FAA071532C7694DBA6F7E18994902A9644F] => Array
(
[name] => Explain DFS and BFS with example | summer-2014
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.OvEFQpvcxXUSh-89DWaN9AAAAA?r=0&pid=Api
[datePublished] => 2020-12-26T17:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://gtu-paper-solution.com/upload/2130702/S2019/DFS_Example.png
[hostPageUrl] => https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2014/Question-4-a
[contentSize] => 24185 B
[width] => 406
[height] => 230
[cDNContentUrl] => https://th.bing.com/th/id/R.3af105429bdcc5751287ef3d0d668df4?rik=de7wqnBRI3yW1A&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fDFS_Example.png&ehk=azueXLkfjIxbKuTR1P6uchitrSbBRy1RK2xVFdJ7UKs%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F4469A20949981E7F6ABD4967C235170AAF0EE75
[accentColor] => 9A6C31
)
[3C276434F0FD0298B10031E19ED500A136B434D9] => Array
(
[name] => Algorithms: TIFR CSE 2014 | Part B | Question: 5
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.EBUUQwLHrYWjU84yTBPITQAAAA?r=0&pid=Api
[datePublished] => 2021-07-07T10:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=1637399947378826925
[hostPageUrl] => https://gateoverflow.in/27180/tifr-cse-2014-part-b-question-5
[contentSize] => 1357 B
[width] => 83
[height] => 71
[cDNContentUrl] => https://th.bing.com/th/id/R.1015144302c7ad85a353ce324c13c84d?rik=w3JGQw%2ffIIkbAA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9D434B631A005DE91E13001B8920DF0F434672C3
[accentColor] => CA0101
)
[198F2466E6238EE598FE16A3FFF28993EEA36747] => Array
(
[name] => Kruskal Algorithm in C : Concept, Explanation & Example
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.vt6MLzU90ZXJKhNX3nnmLQAAAA?r=0&pid=Api
[datePublished] => 2025-04-19T08:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://cdn.prod.website-files.com/5fa61cbbf0d432b3230f62b1/67514e98a9d5bfad73b3944f_srm.png
[hostPageUrl] => https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c
[contentSize] => 28476 B
[width] => 176
[height] => 176
[cDNContentUrl] => https://th.bing.com/th/id/R.bede8c2f353dd195c92a1357de79e62d?rik=kfhCZm4y6F6J7w&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 74763AEE39982FFF3A61EF895EE8326E6642F891
[accentColor] => BF9A0C
)
[B010EAFE7A68992F941516A3FFF28993EEA36747] => Array
(
[name] => Kruskal Algorithm in C : Concept, Explanation & Example
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.3nkQkIAXjtDqh-rcO-c1VgAAAA?r=0&pid=Api
[datePublished] => 2025-04-19T08:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://cdn.prod.website-files.com/5fa61cbbf0d432b3230f62b1/677f5ead04ab0faadc9ad1ba_anna-logo.png
[hostPageUrl] => https://www.ccbp.in/blog/articles/kruskal-algorithm-in-c
[contentSize] => 22270 B
[width] => 176
[height] => 176
[cDNContentUrl] => https://th.bing.com/th/id/R.de79109080178ed0ea87eadc3be73556?rik=CwGu76eGmfJJUQ&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 74763AEE39982FFF3A615149F29986A7EFAE010B
[accentColor] => 9E161B
)
[BB32AE989494BD9327DF82434D929DEF48CC5A20] => Array
(
[name] => Extra Lecture MTH401 (13 November 2022, Sunday), Spanning Tree, Prim's ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.58oQu2v6wODqjNKsFp3-DgAAAA?r=0&pid=Api
[datePublished] => 2023-03-27T23:50:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/42cd6d11b381f9335b80fb8caa53ada6/thumb_300_389.png
[hostPageUrl] => https://www.studocu.com/in/document/lovely-professional-university/btech-civil/extra-lecture-mth401-13-november-2022-sunday-spanning-tree-prims-and-kruskals-algorithm/39837250
[contentSize] => 17526 B
[width] => 300
[height] => 389
[cDNContentUrl] => https://th.bing.com/th/id/R.e7ca10bb6bfac0e0ea8cd2ac169dfe0e?rik=uyPqiUlJ2zly%2fQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 02A5CC84FED929D43428FD7239DB494989EA23BB
[accentColor] => 666666
)
[808F468EBAB1625C728A9364464B422F3788409A] => Array
(
[name] => Code: A-20
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.NgQNcQ4F9HAnxWP-LTmK7wAAAA?r=0&pid=Api
[datePublished] => 2010-02-13T21:46:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://www.iete-elan.ac.in/QPDec06/C06-5-J06_files/image006.jpg
[hostPageUrl] => http://www.iete-elan.ac.in/QPDec06/C06-5-J06.htm
[contentSize] => 7034 B
[width] => 270
[height] => 185
[cDNContentUrl] => https://th.bing.com/th/id/R.36040d710e05f47027c563fe2d398aef?rik=CPhk6KsbJsUnqA&riu=http%3a%2f%2fwww.iete-elan.ac.in%2fQPDec06%2fC06-5-J06_files%2fimage006.jpg&ehk=1tmSOZ4bc%2fb7K2gjVvtis93l5%2ftcpODelRVuBZ%2bNe5k%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A9048873F224B4644639A827C5261BABE864F808
[accentColor] => 3B3B3B
)
[BC43BA8749DE7590352D356BC73543E753FE13D3] => Array
(
[name] => Kruskal Algorithm - Kruskal's algorithm implementation in Python ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.CuWBg14aYFjfpR2GI-tjQAAAAA?r=0&pid=Api
[datePublished] => 2023-06-17T15:33:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/2ef4f10cfded51ad953803498ad507a5/thumb_300_222.png
[hostPageUrl] => https://www.studocu.com/in/document/bharati-vidyapeeths-college-of-engineering/artificial-intelligence/kruskal-algorithm/60864514
[contentSize] => 40401 B
[width] => 300
[height] => 222
[cDNContentUrl] => https://th.bing.com/th/id/R.0ae581835e1a6058dfa51d8623eb6340?rik=yzSreJTtVwlT0g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3D31EF357E34537CB653D2530957ED9478AB34CB
[accentColor] => 4A1C04
)
[C8D52067B7C170560F1832977CD74BD4C6E3F885] => Array
(
[name] => 7.2.1 Single Source Shortest Paths Problem: Dijkstra's Algorithm
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.Zu4tNO7k-I_zmV_hWiUkjQHaDj?r=0&pid=Api
[datePublished] => 2018-04-09T17:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img324.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node162.html
[contentSize] => 4177 B
[width] => 692
[height] => 332
[cDNContentUrl] => https://th.bing.com/th/id/R.66ee2d34eee4f88ff3995fe15a25248d?rik=jF0CdnscB2XwgQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 588F3E6C4DB47DC7792381F065071C7B76025D8C
[accentColor] => 313131
)
[354298398B4562BEDE8F67AA2CC28CC78DAECE98] => Array
(
[name] => A-01/C-01/T-01
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.DTTGzUYyud9mJEhJdRbn4wAAAA?r=0&pid=Api
[datePublished] => 2020-12-11T05:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://iete-elan.ac.in/SolQP/ac_10_typs_08_files/image361.gif
[hostPageUrl] => http://iete-elan.ac.in/SolQP/ac_10_typs_08.htm
[contentSize] => 1011 B
[width] => 229
[height] => 156
[cDNContentUrl] => https://th.bing.com/th/id/R.0d34c6cd4632b9df662448497516e7e3?rik=UySJk7hUJuvt%2bA&riu=http%3a%2f%2fiete-elan.ac.in%2fSolQP%2fac_10_typs_08_files%2fimage361.gif&ehk=gR8iRTpkSiX7z%2bPW%2fXZxGzhQS393vDlXH5gJCsvlQMA%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 89ECEAD87CC82CC2AA76F8EDEB2654B893892453
[accentColor] => 000000
)
[5F3C12CC4AF3A4A2A099D4FC7EBB8E36F3571E22] => Array
(
[name] => Q1. Use Prim's algorithm starting at NODE A to compute the minimum ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.zk82jeCNgVLmI5mhcK96lgHaIr?r=0&pid=Api
[datePublished] => 2022-06-02T19:14:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/dc2/db9c88126df262a8118ec41729758567.jpg
[hostPageUrl] => https://brainly.in/question/52181869
[contentSize] => 20857 B
[width] => 562
[height] => 659
[cDNContentUrl] => https://th.bing.com/th/id/R.ce4f368de08d8152e62399a170af7a96?rik=9cMhzKQ%2fSioKmQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 22E1753F63E8BBE7CF4D990A2A4A3FA4CC21C3F5
[accentColor] => 666666
)
[CCDCB7E1950B8A730938A9F83240B0BEBC87C43B] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.FJMi6TCQYBBFFRYbrrjsFgHaGQ?r=0&pid=Api
[datePublished] => 2021-03-25T04:08:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/kruskals-algorithm/images/whenk.png
[hostPageUrl] => https://ds2-iiith.vlabs.ac.in/exp/min-spanning-trees/kruskals-algorithm/basic-concept.html
[contentSize] => 68457 B
[width] => 715
[height] => 604
[cDNContentUrl] => https://th.bing.com/th/id/R.149322e9309060104515161baeb8ec16?rik=zM17HlmwqDeQgw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B34C78CBEB0B04238F9A839037A8B0591E7BCDCC
[accentColor] => 4E9328
)
[B6512FDB487E0F97CC71572265A7F3DB5A70EDF5] => Array
(
[name] => Binary Trees - HPTU Exam Helper
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.kXbuKMGeGlUqPvMiw9JSjQHaDV?r=0&pid=Api
[datePublished] => 2025-05-26T01:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://res.cloudinary.com/hptuexamhelper/image/upload/f_auto,q_auto/HT5_s9rhe9.png
[hostPageUrl] => https://www.hptuexamhelper.in/theory/cse/semester_iii/data_structures_and_algo/unit_iii/binary_trees
[contentSize] => 19981 B
[width] => 527
[height] => 237
[cDNContentUrl] => https://th.bing.com/th/id/R.9176ee28c19e1a552a3ef322c3d2528d?rik=axXyvYTn8HnMFw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5FDE07A5BD3F7A56227517CC79F0E784BDF2156B
[accentColor] => 3D8E5B
)
[EF5A11596A54BBFF6D86920E6BE4996A1895C5E3] => Array
(
[name] => Max Area of Island
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.WqOsyhx6XIqFvvQpjoQSswHaEl?r=0&pid=Api
[datePublished] => 2025-12-04T10:57:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://learn.innoskrit.in/content/images/2024/02/maxarea1-grid.jpg
[hostPageUrl] => https://learn.innoskrit.in/graph/max-area-of-island/
[contentSize] => 91278 B
[width] => 1053
[height] => 653
[cDNContentUrl] => https://th.bing.com/th/id/R.5aa3acca1c7a5c8a85bef4298e8412b3?rik=%2fqURlaZFu%2f%2fWaA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3E5C5981A6994EB6E02968D6FFBB45A69511A5FE
[accentColor] => CA8501
)
[8081C89E2C5A3F02E46053FFC7E76BA965E3A588] => Array
(
[name] => Banker's Algorithm - practice questions - with steps - Banker’s ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.gew9GY9_JDdZ5J9-QZAdsQHaKe?r=0&pid=Api
[datePublished] => 2022-05-03T04:21:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/a0289e21d544c1cfa49f8d2eb613d0f1/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/vellore-institute-of-technology/computer-engineering/bankers-algorithm-practice-questions-with-steps/23250147
[contentSize] => 107152 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.81ec3d198f7f243759e49f7e41901db1?rik=CBiM6cKl8yBOBg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 885A3E569AB67E7CFF35064E20F3A5C2E98C1808
[accentColor] => CC0000
)
[B26146187B6DCFEA21BCECE94225766B0F07091D] => Array
(
[name] => Strassen's Matrix Multiplication - Design analysis of algorithm - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.F-Vt7WcCRdDQ31BMYHW8NAHaKe?r=0&pid=Api
[datePublished] => 2024-04-06T10:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/3abd090a43495af16e74ae7cb8e60486/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/ajay-kumar-garg-engineering-college-ghaziabad/design-analysis-of-algorithm/strassens-matrix-multiplication/89053010
[contentSize] => 2051740 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.17e56ded670245d0d0df504c6075bc34?rik=KxZkgbfW%2fK4Syw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D19070F0B66752249ECECB12AEFCD6B78164162B
[accentColor] => 484B5F
)
[297DCE2E406A106AD6146882F95CE8A298B73287] => Array
(
[name] => 8.3 Minimum-Cost Spanning Trees
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.R4q4zzzBU4nCGP9evAlRYQHaG1?r=0&pid=Api
[datePublished] => 2019-02-21T03:49:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img416.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node181.html
[contentSize] => 9407 B
[width] => 861
[height] => 795
[cDNContentUrl] => https://th.bing.com/th/id/R.478ab8cf3cc15389c218ff5ebc095161?rik=ktfs4gSmAaZtQQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 78237B892A8EC59F2886416DA601A604E2ECD792
[accentColor] => 434343
)
[5300AC54C0A4887F60CC3A1450FBD1F92DAAED30] => Array
(
[name] => Unit 3: Banker’s Algorithm Example Solutions and Exercises - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.bLeMziDSYVwMCJP2zZntcQHaJl?r=0&pid=Api
[datePublished] => 2023-10-10T01:50:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/ef30f77ba0cf27ff1eb5feb078370ae7/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/srm-institute-of-science-and-technology/operating-systems/unit-3-bankers-algorithm/71825247
[contentSize] => 299190 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.6cb78cce20d2615c0c0893f6cd99ed71?rik=NQDKRQxKiPcGzA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 03DEAAD29F1DBF0541A3CC06F7884A0C45CA0035
[accentColor] => 5F656C
)
[32F19D6C08CC54BF6C889A06449F6B6CE555F8BE] => Array
(
[name] => Prim's Algorithm - unit-3 - Design analysis of algorithm - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.9SM-fFIxjBg1YHDahrNi4wHaKe?r=0&pid=Api
[datePublished] => 2024-04-06T10:20:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/c8130b00f14466d132bb02addc9fe3ef/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/ajay-kumar-garg-engineering-college-ghaziabad/design-analysis-of-algorithm/prims-algorithm-unit-3/89053014
[contentSize] => 2759984 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.f5233e7c52318c18356070da86b362e3?rik=Ix%2fZxoDMRfvGiA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => EB8F555EC6B6F94460A988C6FB45CC80C6D91F23
[accentColor] => 705B66
)
[3055B5938E5FBB40C1AD76703C8A9DB563C5A1FB] => Array
(
[name] => Job sequencing with deadlines - Design analysis of algorithm - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.8nfvKhyGODNmeE1ojuJR3wHaKe?r=0&pid=Api
[datePublished] => 2024-04-06T10:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a3719ca451172aa7fda4b4c7a7c1fd02/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/ajay-kumar-garg-engineering-college-ghaziabad/design-analysis-of-algorithm/job-sequencing-with-deadlines/89052998
[contentSize] => 1330183 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.f277ef2a1c86383366784d688ee251df?rik=A1VbOej1uwQc2g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => BF1A5C365BD9A8C30767DA1C04BBF5E8395B5503
[accentColor] => 3A3F91
)
[220889DCFF979F2030618E074D8147A1A0E4552E] => Array
(
[name] => Fractional Knapsack using Greedy Approach - Design analysis of ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.38DKHDTKtxnCfYQJjOcAOQHaKe?r=0&pid=Api
[datePublished] => 2024-04-06T10:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a585bfb8f0070d6ac18b92aae825f39a/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/ajay-kumar-garg-engineering-college-ghaziabad/design-analysis-of-algorithm/fractional-knapsack-using-greedy-approach/89053009
[contentSize] => 902614 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.dfc0ca1c34cab719c27d84098ce70039?rik=IoCYzf95%2bQIDFg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E2554E0A1A7418D470E8160302F979FFCD988022
[accentColor] => A02C2B
)
[98F0A7FEA92964B66AC12EB0A731C2C8A88B19D9] => Array
(
[name] => Prim's Algorithm: Understanding Minimum Spanning Trees | The Flying ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.tqJtivZuBdyBabg6sbYXagHaEc?r=0&pid=Api
[datePublished] => 2024-06-26T04:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://theflyingbirds.in/public/posts/prims-algorithm-understanding-minimum-spanning-trees.jpg
[hostPageUrl] => https://theflyingbirds.in/blog/prims-algorithm-understanding-minimum-spanning-trees
[contentSize] => 84503 B
[width] => 1200
[height] => 720
[cDNContentUrl] => https://th.bing.com/th/id/R.b6a26d8af66e05dc8169b83ab1b6176a?rik=iQ9675qSRmumHA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9D91B88A8C2C137A0BE21CA66B46929AEF7A0F89
[accentColor] => 346997
)
[52E4774D5F9573F37D1110151607A5CE5E747E3A] => Array
(
[name] => Analysis Of Algorithms - MUM-ENGIN-001 - MU - Studocu
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.IKbPhs14kc68n1DZqYBRGAAAAA?r=0&pid=Api
[datePublished] => 2021-03-26T04:19:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/47b93015e57bc86ac1462d2ca8a63500/thumb_115_81.png
[hostPageUrl] => https://www.studocu.com/in/course/university-of-mumbai/analysis-of-algorithms/1288090
[contentSize] => 10445 B
[width] => 115
[height] => 81
[cDNContentUrl] => https://th.bing.com/th/id/R.20a6cf86cd7891cebc9f50d9a9805118?rik=JU531PVZNz%2fXEQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A3E747E5EC5A7061510111D73F3759F5D4774E25
[accentColor] => 7E4D4D
)
[D364DE895E27F59C0B5CEBA86F752A8C3A12CF80] => Array
(
[name] => Kruskal Wallis Anova - Chapter Summary based on IGNOU materials and ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.HXN_SBknE4EfWEDg2AaJdAHaJl?r=0&pid=Api
[datePublished] => 2022-08-02T09:04:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/ee8e0d5c5d9b254259899569ca2b4484/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/indira-gandhi-national-open-university/statistics-in-psychology/kruskal-wallis-anova-chapter-summary-based-on-ignou-materials-and-additional-reference-books-with/31492848
[contentSize] => 270528 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.1d737f48192713811f5840e0d8068974?rik=PUbtmOVyX8mwxQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 08FC21A3C8A257F68ABEC5B0C95F72E598ED463D
[accentColor] => 51535A
)
[9CE88B919D481DC6AED8D4AF4A5F26D9D823A3A4] => Array
(
[name] => Algorithms: Minimum spanning tree
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.gdn9VpQjt2SOysf-aVR_DAHaEk?r=0&pid=Api
[datePublished] => 2018-01-02T07:11:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=2802376283960704595
[hostPageUrl] => https://gateoverflow.in/188624/minimum-spanning-tree
[contentSize] => 46340 B
[width] => 600
[height] => 370
[cDNContentUrl] => https://th.bing.com/th/id/R.81d9fd569423b7648ecac7fe69547f0c?rik=yY64GdmE0WzqjQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4A3A328D9D62F5A4FA4D8DEA6CD184D919B88EC9
[accentColor] => 4C677F
)
[4599B91257DF696F57AA678ADCC472F5B55D61AA] => Array
(
[name] => Do kruskal's and prim generate different minimum spanning trees ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.ujCGajsM_x9_SwWuuEsK_gAAAA?r=0&pid=Api
[datePublished] => 2020-01-04T10:43:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d4a/de043453f9515a3cb1a2a29531969902.jpg
[hostPageUrl] => https://brainly.in/question/14472485
[contentSize] => 3414 B
[width] => 100
[height] => 100
[cDNContentUrl] => https://th.bing.com/th/id/R.ba30866a3b0cff1f7f4b05aeb84b0afe?rik=VJmbIXX9lvZ1qg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AA16D55B5F274CCDA876AA75F696FD75219B9954
[accentColor] => 9D3E2E
)
[A425A9AB2A61991031BA725831923F6A146807B6] => Array
(
[name] => Example of banker's algorithm for deadlock avoidance - Brainly.in
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.E4yni7gnhKATXH8SaKPRpgHaSP?r=0&pid=Api
[datePublished] => 2018-12-12T14:14:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d49/ec84f9ee7150292e089d4741fb75e693.jpg
[hostPageUrl] => https://brainly.in/question/6498042
[contentSize] => 151785 B
[width] => 1080
[height] => 2660
[cDNContentUrl] => https://th.bing.com/th/id/R.138ca78bb82784a0135c7f1268a3d1a6?rik=SlKauqIWmQETqw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 6B708641A6F329138527AB13019916A2BA9A524A
[accentColor] => 464A4B
)
[D2E1FEE69B8A767770DD9D747346A3C24E441167] => Array
(
[name] => 8.3.2 Prim's Algorithm
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.R2uc9DNo9HjxMZVqlPAFrQAAAA?r=0&pid=Api
[datePublished] => 2018-04-02T13:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img79.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node183.html
[contentSize] => 180 B
[width] => 24
[height] => 45
[cDNContentUrl] => https://th.bing.com/th/id/R.476b9cf43368f478f131956a94f005ad?rik=LR7vbrmoZ3cH3Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 761144E42C3A643747D9DD077767A8B96EEF1E2D
[accentColor] => 666666
)
[D349BAB787985453205ABCABB1DE8D41FAC3FF13] => Array
(
[name] => DS-Important Topics - Good morning - B. III Sem. Data Structures ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.X23VHdIE9DVK1GUfgE5KVAAAAA?r=0&pid=Api
[datePublished] => 2025-05-24T13:57:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/3ed80ef3c8f2de15f3c1bd19de7cc70c/thumb_300_424.png
[hostPageUrl] => https://www.studocu.com/in/document/visvesvaraya-technological-university/data-structures/ds-important-topics-good-morning/127984985
[contentSize] => 37503 B
[width] => 300
[height] => 424
[cDNContentUrl] => https://th.bing.com/th/id/R.5f6dd51dd204f4354ad4651f804e4a54?rik=PZSre3iJRTUCpQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 31FF3CAF14D8ED1BBACBA502354589787BAB943D
[accentColor] => 474747
)
[7A170EBEAEEE0BD60DE5C04A7D3A73B8D900CC20] => Array
(
[name] => Searching Strategies : Breadth First Search
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.fuKtzbeBLqPiHYVWAo0j2gHaKe?r=0&pid=Api
[datePublished] => 2020-12-12T18:13:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://minigranth.in/images/tutorials/AI%20IMAGES/BFS.jpg
[hostPageUrl] => https://minigranth.in/artificial-intelligence-tutorial/searching-strategies-in-ai
[contentSize] => 179039 B
[width] => 1240
[height] => 1754
[cDNContentUrl] => https://th.bing.com/th/id/R.7ee2adcdb7812ea3e21d8556028d23da?rik=p3Hg6%2brusG3QXg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 02CC009D8B37A3D7A40C5ED06DB0EEEAEBE071A7
[accentColor] => 434343
)
[478F6073AC15AA3F197C58C663F542D7D0C52B58] => Array
(
[name] => Banker's Algorithm Example Solutions and Safety Analysis - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.q7Dky7J9LJHiGK9_VHSHcQHaKe?r=0&pid=Api
[datePublished] => 2023-10-30T04:30:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/635626fe553619247b0d52e804a17b96/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/vellore-institute-of-technology/operating-systems/bankers-algorithm/74303173
[contentSize] => 176362 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.abb0e4cbb27d2c91e218af7f54748771?rik=dPgGN8pRqvORxw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 85B25C0D7D245F366C85C791F3AA51CA3706F874
[accentColor] => 484848
)
[3490CE4C506D36075A3C1842D83E259E0486762B] => Array
(
[name] => DAA-UNIT-4: Algorithms for Shortest Paths and Minimum Spanning Trees ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.V6nhqNvFR5jglkuWm1KJfgHaKd?r=0&pid=Api
[datePublished] => 2025-10-10T08:18:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/ea3c5940320b4577c71d4c244bf85c5f/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/sri-siddhartha-institute-of-technology/computer-science-and-engineering/daa-unit-4-algorithms-for-shortest-paths-and-minimum-spanning-trees/141226563
[contentSize] => 402178 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.57a9e1a8dbc54798e0964b969b52897e?rik=QwnsxAXWY3Clww&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B2676840E952E38D2481C3A57063D605C4EC0943
[accentColor] => BF0C0C
)
[D07F26755A988B7B2E8E6EB35305C8771EE0C4DD] => Array
(
[name] => Transportation networks
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.SzjiaEjKh3ELQCi6umgtfgAAAA?r=0&pid=Api
[datePublished] => 2020-06-10T12:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.civil.iitb.ac.in/tvm/1100_LnTse/135_lntse/plain/img7.gif
[hostPageUrl] => https://www.civil.iitb.ac.in/tvm/1100_LnTse/135_lntse/plain/plain.html
[contentSize] => 174 B
[width] => 19
[height] => 33
[cDNContentUrl] => https://th.bing.com/th/id/R.4b38e26848ca87710b4028baba682d7e?rik=DfdiV6WJuLfi6A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => DD4C0EE1778C50353BE6E8E2B7B889A55762F70D
[accentColor] => 666666
)
[D097D28EEE37FB53E141E509F6C548913F5FAB88] => Array
(
[name] => Draw a circle of radius 7cm. From a point 12 cm away from its centre ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.SE3J-SENliOp_2GsvQcLSgHaEz?r=0&pid=Api
[datePublished] => 2020-08-02T13:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d34/2a23567164d7247fa9fff3a81552f2d0.png
[hostPageUrl] => https://brainly.in/question/20384246
[contentSize] => 11413 B
[width] => 682
[height] => 443
[cDNContentUrl] => https://th.bing.com/th/id/R.484dc9f9210d9623a9ff61acbd070b4a?rik=DXkt6O5zvzUeFA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 88BAF5F319845C6F905E141E35BF73EEE82D790D
[accentColor] => 327499
)
[87C84ECBBEF14A793E473DE1E660449D41CA35E7] => Array
(
[name] => Creative Coding
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.UDSfpoNkZoYaeIB-bDmo5gHaE8?r=0&pid=Api
[datePublished] => 2025-05-07T20:00:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ahduni.edu.in/site/assets/files/30820/predator-prey_ecosystem.jpg
[hostPageUrl] => https://ahduni.edu.in/academics/schools-centres/centre-for-learning-futures/digital-curve/creative-coding/
[contentSize] => 10175 B
[width] => 600
[height] => 400
[cDNContentUrl] => https://th.bing.com/th/id/R.50349fa6836466861a78807e6c39a8e6?rik=eIzkvOsfpJfjdA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7E53AC14D944066E1ED374E397A41FEBBCE48C78
[accentColor] => C90203
)
[7ED8C82D2330CC2679DDED69AB3DE0F4B9FC8820] => Array
(
[name] => Stacks | Learn Everything about Stacks in DSA
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.uROZZrptm-9_IBTSxnT9BAHaE5?r=0&pid=Api
[datePublished] => 2023-01-23T17:10:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://talentbattle.in/Files/C4U_Images/C4U_CKEDITOR_IMAGES/IMG10951_stacks.png
[hostPageUrl] => https://talentbattle.in/learn-data-structures-and-algorithms-for-free/stacks
[contentSize] => 74140 B
[width] => 586
[height] => 387
[cDNContentUrl] => https://th.bing.com/th/id/R.b9139966ba6d9bef7f2014d2c674fd04?rik=542M0jIDzGKX3Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0288CF9B4F0ED3BA96DEDD9762CC0332D28C8DE7
[accentColor] => 60636B
)
[10F5D804953E615987201A78D972F26B9250C9ED] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.d4N_Oc5WyzLcrV5KtB14swAAAA?r=0&pid=Api
[datePublished] => 2019-09-23T16:52:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://vlabs.iitkgp.ac.in/coa/images/flow2.png
[hostPageUrl] => http://vlabs.iitkgp.ac.in/coa/exp7/index.html
[contentSize] => 5320 B
[width] => 399
[height] => 462
[cDNContentUrl] => https://th.bing.com/th/id/R.77837f39ce56cb32dcad5e4ab41d78b3?rik=AV%2bNQFnjFpV4Ag&riu=http%3a%2f%2fvlabs.iitkgp.ac.in%2fcoa%2fimages%2fflow2.png&ehk=hrg7st5%2b1nQgdEyURzPCdImo6g5DyWThgEEJtqvWRL8%3d&risl=&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => DE9C0529B62F279D87A102789516E359408D5F01
[accentColor] => 1D1D1D
)
[D7526ACF445D1A3956206A9AFF31C8A6C0C1891D] => Array
(
[name] => CS425: Computer Networks : Lecture 25
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Fk4rLkP4C-70PlHkh0pnvgHaFb?r=0&pid=Api
[datePublished] => 2015-02-03T16:47:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.cse.iitk.ac.in/users/dheeraj/cs425/fig.lec25/dijkstra1.gif
[hostPageUrl] => https://www.cse.iitk.ac.in/users/dheeraj/cs425/lec25.html
[contentSize] => 34887 B
[width] => 585
[height] => 429
[cDNContentUrl] => https://th.bing.com/th/id/R.164e2b2e43f80beef43e51e4874a67be?rik=fSWm%2fETVoZNlAg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D1981C0C6A8C13FFA9A6026593A1D544FCA6257D
[accentColor] => 1D1D1D
)
[8E4F7751B9F8BF1BC0B9777FE7F13842A9E278A8] => Array
(
[name] => Convert the given graph with weighted edges to minimal spanning tree ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.rs2FhGcbpXDCDL46-FVCIgAAAA?r=0&pid=Api
[datePublished] => 2022-01-11T06:58:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d09/a8e076ed97faf9a2fec4ef7a323f18a3.jpg
[hostPageUrl] => https://brainly.in/question/49476753
[contentSize] => 2991 B
[width] => 100
[height] => 100
[cDNContentUrl] => https://th.bing.com/th/id/R.aecd8584671ba570c20cbe3af8554222?rik=6PR3FZuP%2b7EMmw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 8A872E9A24831F7EF7779B0CB1FB8F9B1577F4E8
[accentColor] => 704033
)
[EDC99536AA26516EB61AAA0C8456CF915FA08230] => Array
(
[name] => KS1 Everyday Algorithms Posters KS1 Twinkl
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.rbp8y4I0xlxGs7QyT4KMkAHaDt?r=0&pid=Api
[datePublished] => 2022-12-16T09:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://images.twinkl.co.uk/tw1n/image/private/t_630_eco/image_repo/92/77/t-i-1664530451-ks1-everyday-algorithms-posters_ver_2.jpg
[hostPageUrl] => https://www.twinkl.co.in/resource/ks1-everyday-algorithms-posters-t-i-1664530451
[contentSize] => 61698 B
[width] => 630
[height] => 315
[cDNContentUrl] => https://th.bing.com/th/id/R.adba7ccb8234c65c46b3b4324f828c90?rik=3pxZY6piFeZroQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 03280AF519FC6548C0AAA16BE61562AA63599CDE
[accentColor] => 1882B3
)
[D2B21CEE1260A66F9E3367AA2CC28CC78DAECE98] => Array
(
[name] => A-01/C-01/T-01
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.Krs285slEWi7To4TpXjYHQAAAA?r=0&pid=Api
[datePublished] => 2020-12-11T05:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://iete-elan.ac.in/SolQP/ac_10_typs_08_files/image441.jpg
[hostPageUrl] => http://iete-elan.ac.in/SolQP/ac_10_typs_08.htm
[contentSize] => 11239 B
[width] => 372
[height] => 275
[cDNContentUrl] => https://th.bing.com/th/id/R.2abb36f39b251168bb4e8e13a578d81d?rik=LSvB7iEGavbpMw&riu=http%3a%2f%2fiete-elan.ac.in%2fSolQP%2fac_10_typs_08_files%2fimage441.jpg&ehk=uJFGCsq%2bU2CicwQt8jh1py3vy%2fxwt4M5ayUuDLR7y0k%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 89ECEAD87CC82CC2AA7633E9F66A0621EEC12B2D
[accentColor] => 3D3D3D
)
[CED0BA11F2D253501516128680F4F43DA8B923D4] => Array
(
[name] => Banker's algorithm example solutions for exercise 1 - Studocu
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.zgcruUTR5OaXA8XcGSBD6QAAAA?r=0&pid=Api
[datePublished] => 2025-04-16T05:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/2a76e5dac05e1ef40d897dcb326dfc1a/thumb_300_424.png
[hostPageUrl] => https://www.studocu.com/in/document/sns-college-of-technology/big-data-analytics/bankers-algorithm-example-solutions-for-exercise-1/123910442
[contentSize] => 26695 B
[width] => 300
[height] => 424
[cDNContentUrl] => https://th.bing.com/th/id/R.ce072bb944d1e4e69703c5dc192043e9?rik=7A2rES8tNQVRYQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4D329B8AD34F4F086821615105352D2F11AB0DEC
[accentColor] => 3E3E3E
)
[0C3825434EA720AD6E452FDD0A42B46398FC8E3B] => Array
(
[name] => Grade R Coding Worksheet: Safari (CAPS Aligned)
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.NMEHWDDmqLE1w-ZIDHuQUwAAAA?r=0&pid=Api
[datePublished] => 2024-03-01T11:25:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://images.twinkl.co.uk/tw1n/image/private/t_630_eco/image_repo/27/4c/za-nst-1708587506-grade-r-robotics-and-coding-algorithms-safari_ver_1.jpg
[hostPageUrl] => https://www.twinkl.co.in/resource/grade-r-robotics-and-coding-algorithms-safari-za-nst-1708587506
[contentSize] => 32232 B
[width] => 474
[height] => 237
[cDNContentUrl] => https://th.bing.com/th/id/R.34c1075830e6a8b135c3e6480c7b9053?rik=wINSNOR6AtrmVA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B3E8CF89364B24A0DDF254E6DA027AE4345283C0
[accentColor] => 0E5D2D
)
[1B9C4129ADE7A4C8F3E0E15F468A01AD1748C467] => Array
(
[name] => AOA Assignment 2 Solved Notes (AIML 3rd Sem) - Key Concepts & Solutions ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.qKfSwKLTxfodwj4zh_OUEQHaEK?r=0&pid=Api
[datePublished] => 2025-11-14T02:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/bdf22519d79e9402168541dc19fa7d45/thumb_784_441.png
[hostPageUrl] => https://www.studocu.com/in/document/devanga-sangha-first-grade-college/management-accounting/aoa-assignment-2-solved-notes-aiml-3rd-sem-key-concepts-solutions/145078129
[contentSize] => 35070 B
[width] => 784
[height] => 441
[cDNContentUrl] => https://th.bing.com/th/id/R.a8a7d2c0a2d3c5fa1dc23e3387f39411?rik=sckUktp%2bSow%2fDg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 764C8471DA10A864F51E0E3F8C4A7EDA9214C9B1
[accentColor] => 414141
)
[96B9B5306A11437D9699DB58C41BFF371428DBCE] => Array
(
[name] => Operations 1: Understanding Computer Instruction Execution - Studocu
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.uqB5ixXKP-eKUsPstSXiXAHaFP?r=0&pid=Api
[datePublished] => 2025-09-13T21:38:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://website-assets.studocu.com/img/document_thumbnails/a6a06763d9c269a47718352f44cec729/thumb_1200_849.png
[hostPageUrl] => https://www.studocu.com/in/document/indian-institute-of-technology-delhi/software-fundamentals-for-computer-technology/operations-1-understanding-computer-instruction-execution/138300501
[contentSize] => 126728 B
[width] => 1200
[height] => 849
[cDNContentUrl] => https://th.bing.com/th/id/R.baa0798b15ca3fe78a52c3ecb525e25c?rik=aZtbA6YRNNdpmQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => ECBD824173FFB14C85BD9969D73411A6035B9B69
[accentColor] => 7D644E
)
[B789D04BACC879C9C5E4B7FBD47E1B162E624DEB] => Array
(
[name] => Graph Theory - Course
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.zxAJ93daylSInuLGEEC9IQAAAA?r=0&pid=Api
[datePublished] => 2024-05-13T01:27:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://storage.googleapis.com/swayam-node2-production.appspot.com/instructor/assets/i_5263.png
[hostPageUrl] => https://onlinecourses.swayam2.ac.in/cec24_ma12/preview
[contentSize] => 27561 B
[width] => 98
[height] => 134
[cDNContentUrl] => https://th.bing.com/th/id/R.cf1009f7775aca54889ee2c61040bd21?rik=e5gNtMqMl5xcTg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => BED426E261B1E74DBF7B4E5C9C978CCAB40D987B
[accentColor] => 9C2F32
)
[96C7AC8DCDB2293C30BDD4A7B38361B2E2B5DDC8] => Array
(
[name] => Google hiring tips: Interviewer shares commonly asked topics that can ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.SVbXUiFES6Hoh6lMZ6oAswHaFj?r=0&pid=Api
[datePublished] => 2025-03-17T17:27:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://img-s-msn-com.akamaized.net/tenant/amp/entityid/AA1B6aIu.img?w=1200&h=900&m=4&q=65
[hostPageUrl] => https://www.msn.com/en-in/money/news/google-hiring-tips-interviewer-shares-commonly-asked-topics-that-can-make-or-break-your-interview/ar-AA1B6miP
[contentSize] => 131072 B
[width] => 1200
[height] => 900
[cDNContentUrl] => https://th.bing.com/th/id/R.4956d75221444ba1e887a94c67aa00b3?rik=aXzK2NwrksMD2w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 8CDD5B2E2B16383B7A4DDB03C3922BDCD8CA7C69
[accentColor] => 7C6441
)
[057E2D633FBD5A55268A6EB44BC643732C52F93C] => Array
(
[name] => Course Page - IIT Madras Degree Program
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.nkQ4w16QlnXPCmBWyXbNVgAAAA?r=0&pid=Api
[datePublished] => 2023-06-19T16:11:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://study.iitm.ac.in/ds/assets/img/academics/instructors/9001_2x.jpg
[hostPageUrl] => https://study.iitm.ac.in/ds/course_pages/BSMA1001.html
[contentSize] => 56550 B
[width] => 200
[height] => 200
[cDNContentUrl] => https://th.bing.com/th/id/R.9e4438c35e909675cf0a6056c976cd56?rik=UOfSNvPbpVViqA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C39F25C237346CB44BE6A86255A5DBF336D2E750
[accentColor] => 379490
)
[A776BA1B800857CD9BC246A377B2D45C5F85CD80] => Array
(
[name] => Introduction to Graph - Data Structures Tutorial | Study Glance
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.bbDTVqAJotx7VpKHaMrWhgHaCz?r=0&pid=Api
[datePublished] => 2023-12-21T01:23:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://studyglance.in/ds/images/Types-of-graphs.jpg
[hostPageUrl] => https://studyglance.in/ds/display.php?tno=32&topic=Introduction-to-Graph
[contentSize] => 721264 B
[width] => 2482
[height] => 942
[cDNContentUrl] => https://th.bing.com/th/id/R.6db0d356a009a2dc7b56928768cad686?rik=emersQiAddy5LA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 08DC58F5C54D2B773A642CB9DC758008B1AB677A
[accentColor] => 227DA9
)
[4B46EFC1ED9DA7681D570E9C12D58AA5E7578367] => Array
(
[name] => Flowchart Algorithm
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.kkNTfl5RfVg4wHwLLSORCwAAAA?r=0&pid=Api
[datePublished] => 2020-12-12T16:46:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://vedveethi.co.in/PrincipleOfCLang/Algorithm%20and%20Flowchart_files/image003.jpg
[hostPageUrl] => https://vedveethi.co.in/PrincipleOfCLang/Algorithm%20and%20Flowchart.htm
[contentSize] => 16053 B
[width] => 436
[height] => 633
[cDNContentUrl] => https://th.bing.com/th/id/R.9243537e5e517d5838c07c0b2d23910b?rik=tGT%2bHN7ZeobRdQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7638757E5AA85D21C9E075D1867AD9DE1CFE64B4
[accentColor] => 5F4E44
)
[CCDF26DEA13E2169E1E6C2BBE0E8494EA7B11E6B] => Array
(
[name] => Introduction to Algorithms
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP._nMSRyzARxjqDu6gR2ACYQHaIb?r=0&pid=Api
[datePublished] => 2022-08-02T02:29:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://m.media-amazon.com/images/I/61Mw06x2XcL._SL1500_.jpg
[hostPageUrl] => https://www.amazon.in/Introduction-Algorithms-fourth-Thomas-Cormen/dp/026204630X
[contentSize] => 83942 B
[width] => 1317
[height] => 1500
[cDNContentUrl] => https://th.bing.com/th/id/R.fe7312472cc04718ea0eeea047600261?rik=zP1i7RrjEpYebg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B6E11B7AE4948E0EBB2C6E1E9612E31AED62FDCC
[accentColor] => 004D86
)
[8707E6F71C8525EE42B79BA30E1D2570BF52DB5A] => Array
(
[name] => Data structures & Algorithms
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.3Cve54FVKjQg_NNBmHQU0gHaDX?r=0&pid=Api
[datePublished] => 2024-10-02T15:28:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://devacomputerscience.in/images/mail_img.png
[hostPageUrl] => https://devacomputerscience.in/
[contentSize] => 48667 B
[width] => 1232
[height] => 559
[cDNContentUrl] => https://th.bing.com/th/id/R.dc2bdee781552a3420fcd341987414d2?rik=eHBuf8FYUu4kew&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A5BD25FB0752D1E03AB97B24EE5258C17F6E7078
[accentColor] => CC9A00
)
[3A3A54B6D7F5DDA595201B252F43A188B9F7BE0E] => Array
(
[name] => Consider the following snapshot of a system: Process Maximum A B ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.7XLMSCmWx6v9jTIGmz0atAHaHf?r=0&pid=Api
[datePublished] => 2023-01-15T14:09:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d47/ebe42650daf2271223818dae14eca443.jpg
[hostPageUrl] => https://brainly.in/question/54687266
[contentSize] => 570017 B
[width] => 1865
[height] => 1888
[cDNContentUrl] => https://th.bing.com/th/id/R.ed72cc482996c7abfd8d32069b3d1ab4?rik=o6NFa31f3VpZAg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E0EB7F9B881A34F252B102595ADD5F7D6B45A3A3
[accentColor] => 292C39
)
[125C195250047AE34B5857AB41AAB7587EA001BE] => Array
(
[name] => Faculty Blogs
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.nCQ0W0pG7aX2G4abaJiZmQHaDs?r=0&pid=Api
[datePublished] => 2023-02-02T23:26:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://cdn.programiz.com/sites/tutorial2program/files/Bellman-Ford-Algorithm-2.png
[hostPageUrl] => https://marwaricollegeranchi.ac.in/FacultyBlogDetails.aspx?pid=Bachelor%20of%20Science%20in%20Computer%20Application&rid=prasadanjana23@gmail.com&bid=182
[contentSize] => 89541 B
[width] => 1460
[height] => 728
[cDNContentUrl] => https://th.bing.com/th/id/R.9c24345b4a46eda5f61b869b68989999?rik=IcWRJQVApz60hQ&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => EB100AE7857BAA14BA7585B43EA740052591C521
[accentColor] => 6209C2
)
)
[relatedSearches] => Array
(
[0] => Array
(
[text] => Kruskal
[displayText] => Kruskal
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5815.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[1] => Array
(
[text] => MST Graph
[displayText] => MST Graph
[webSearchUrl] => https://www.bing.com/images/search?q=MST+Graph&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5817.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=MST+Graph
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=MST+Graph&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[2] => Array
(
[text] => Dijkstra's Algorithm Example
[displayText] => Dijkstra's Algorithm Example
[webSearchUrl] => https://www.bing.com/images/search?q=Dijkstra%27s+Algorithm+Example&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5819.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Dijkstra%27s+Algorithm+Example
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Dijkstra%27s+Algorithm+Example&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[3] => Array
(
[text] => Dijkstra's Algorithm Animation
[displayText] => Dijkstra's Algorithm Animation
[webSearchUrl] => https://www.bing.com/images/search?q=Dijkstra%27s+Algorithm+Animation&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5821.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Dijkstra%27s+Algorithm+Animation
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Dijkstra%27s+Algorithm+Animation&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[4] => Array
(
[text] => Minimum Spanning-Tree Example
[displayText] => Minimum Spanning-Tree Example
[webSearchUrl] => https://www.bing.com/images/search?q=Minimum+Spanning-Tree+Example&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5823.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Minimum+Spanning-Tree+Example
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Minimum+Spanning-Tree+Example&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[5] => Array
(
[text] => Algoritma Kruskal
[displayText] => Algoritma Kruskal
[webSearchUrl] => https://www.bing.com/images/search?q=Algoritma+Kruskal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5825.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Algoritma+Kruskal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Algoritma+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[6] => Array
(
[text] => Computer Algorithm Examples
[displayText] => Computer Algorithm Examples
[webSearchUrl] => https://www.bing.com/images/search?q=Computer+Algorithm+Examples&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5827.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Computer+Algorithm+Examples
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Computer+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[7] => Array
(
[text] => Kruskal Diagram
[displayText] => Kruskal Diagram
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Diagram&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5829.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Diagram
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Kruskal+Diagram&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[8] => Array
(
[text] => Spanning-Tree Graph Theory
[displayText] => Spanning-Tree Graph Theory
[webSearchUrl] => https://www.bing.com/images/search?q=Spanning-Tree+Graph+Theory&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5831.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Spanning-Tree+Graph+Theory
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Spanning-Tree+Graph+Theory&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[9] => Array
(
[text] => Kruskal's Tree Theorem
[displayText] => Kruskal's Tree Theorem
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal%27s+Tree+Theorem&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5833.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal%27s+Tree+Theorem
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Kruskal%27s+Tree+Theorem&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[10] => Array
(
[text] => Kruskal Algo
[displayText] => Kruskal Algo
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algo&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5835.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algo
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Kruskal+Algo&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[11] => Array
(
[text] => Prims vs Kruskal
[displayText] => Prims vs Kruskal
[webSearchUrl] => https://www.bing.com/images/search?q=Prims+vs+Kruskal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5837.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Prims+vs+Kruskal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Prims+vs+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[12] => Array
(
[text] => Simplest Example of Kruskal Algorithm
[displayText] => Simplest Example of Kruskal Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=Simplest+Example+of+Kruskal+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5839.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Simplest+Example+of+Kruskal+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Simplest+Example+of+Kruskal+Algorithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[13] => Array
(
[text] => Example of Kruskal Algorithm with Solution
[displayText] => Example of Kruskal Algorithm with Solution
[webSearchUrl] => https://www.bing.com/images/search?q=Example+of+Kruskal+Algorithm+with+Solution&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5841.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Example+of+Kruskal+Algorithm+with+Solution
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Example+of+Kruskal+Algorithm+with+Solution&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[14] => Array
(
[text] => Kruskal Algorith
[displayText] => Kruskal Algorith
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorith&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5843.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorith
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Kruskal+Algorith&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[15] => Array
(
[text] => Prims and Kruskal's
[displayText] => Prims and Kruskal's
[webSearchUrl] => https://www.bing.com/images/search?q=Prims+and+Kruskal%27s&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5845.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Prims+and+Kruskal%27s
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Prims+and+Kruskal%27s&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[16] => Array
(
[text] => Kruskal Algorithm Flowchart
[displayText] => Kruskal Algorithm Flowchart
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorithm+Flowchart&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5847.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Flowchart
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Kruskal+Algorithm+Flowchart&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[17] => Array
(
[text] => Minimal Spanning-Tree
[displayText] => Minimal Spanning-Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Minimal+Spanning-Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5849.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Minimal+Spanning-Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Minimal+Spanning-Tree&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[18] => Array
(
[text] => Basic Algorithm Examples
[displayText] => Basic Algorithm Examples
[webSearchUrl] => https://www.bing.com/images/search?q=Basic+Algorithm+Examples&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5851.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Basic+Algorithm+Examples
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Basic+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[19] => Array
(
[text] => Kruskal Alogarithm
[displayText] => Kruskal Alogarithm
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Alogarithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5853.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Alogarithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Kruskal+Alogarithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[20] => Array
(
[text] => Algoritmo De Kruskal
[displayText] => Algoritmo De Kruskal
[webSearchUrl] => https://www.bing.com/images/search?q=Algoritmo+De+Kruskal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5855.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Algoritmo+De+Kruskal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Algoritmo+De+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[21] => Array
(
[text] => Kruskal Algorithm Simple Graph Example
[displayText] => Kruskal Algorithm Simple Graph Example
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorithm+Simple+Graph+Example&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5857.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Simple+Graph+Example
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Kruskal+Algorithm+Simple+Graph+Example&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[22] => Array
(
[text] => Joseph Bernard Kruskal
[displayText] => Joseph Bernard Kruskal
[webSearchUrl] => https://www.bing.com/images/search?q=Joseph+Bernard+Kruskal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5859.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Joseph+Bernard+Kruskal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Joseph+Bernard+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[23] => Array
(
[text] => Algorithm Sample
[displayText] => Algorithm Sample
[webSearchUrl] => https://www.bing.com/images/search?q=Algorithm+Sample&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5861.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Algorithm+Sample
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Algorithm+Sample&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[24] => Array
(
[text] => Kruskal Algorithm Example Step by Step Matrix
[displayText] => Kruskal Algorithm Example Step by Step Matrix
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorithm+Example+Step+by+Step+Matrix&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5863.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Example+Step+by+Step+Matrix
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Kruskal+Algorithm+Example+Step+by+Step+Matrix&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[25] => Array
(
[text] => Give Me a Kruskal Algorithm Example Graph
[displayText] => Give Me a Kruskal Algorithm Example Graph
[webSearchUrl] => https://www.bing.com/images/search?q=Give+Me+a+Kruskal+Algorithm+Example+Graph&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5865.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Give+Me+a+Kruskal+Algorithm+Example+Graph
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Give+Me+a+Kruskal+Algorithm+Example+Graph&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[26] => Array
(
[text] => Kruskall
[displayText] => Kruskall
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskall&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5867.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskall
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Kruskall&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[27] => Array
(
[text] => Kruskal Algorithm Cormen
[displayText] => Kruskal Algorithm Cormen
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorithm+Cormen&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5869.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Cormen
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Kruskal+Algorithm+Cormen&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[28] => Array
(
[text] => Kruskal Algoithm
[displayText] => Kruskal Algoithm
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algoithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5871.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algoithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Kruskal+Algoithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[29] => Array
(
[text] => Kruskal Coordinates
[displayText] => Kruskal Coordinates
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Coordinates&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5873.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Coordinates
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Kruskal+Coordinates&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[30] => Array
(
[text] => Kruskal Algorithm Book
[displayText] => Kruskal Algorithm Book
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorithm+Book&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5875.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Book
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Kruskal+Algorithm+Book&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[31] => Array
(
[text] => Java Algorithm Examples
[displayText] => Java Algorithm Examples
[webSearchUrl] => https://www.bing.com/images/search?q=Java+Algorithm+Examples&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5877.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Java+Algorithm+Examples
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Java+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[32] => Array
(
[text] => Graph Examples for Kruskal
[displayText] => Graph Examples for Kruskal
[webSearchUrl] => https://www.bing.com/images/search?q=Graph+Examples+for+Kruskal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5879.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Graph+Examples+for+Kruskal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Graph+Examples+for+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[33] => Array
(
[text] => Kruskal Algorthem
[displayText] => Kruskal Algorthem
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorthem&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5881.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorthem
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Kruskal+Algorthem&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[34] => Array
(
[text] => Kruskal Algorithm Question Graph
[displayText] => Kruskal Algorithm Question Graph
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorithm+Question+Graph&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5883.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+Question+Graph
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Kruskal+Algorithm+Question+Graph&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[35] => Array
(
[text] => Kruskal Algorithm PNG
[displayText] => Kruskal Algorithm PNG
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorithm+PNG&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5885.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+PNG
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Kruskal+Algorithm+PNG&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[36] => Array
(
[text] => Kruskal Solved Example
[displayText] => Kruskal Solved Example
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Solved+Example&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5887.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Solved+Example
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Kruskal+Solved+Example&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[37] => Array
(
[text] => Examples of Simple Algorithms
[displayText] => Examples of Simple Algorithms
[webSearchUrl] => https://www.bing.com/images/search?q=Examples+of+Simple+Algorithms&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5889.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Examples+of+Simple+Algorithms
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Examples+of+Simple+Algorithms&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[38] => Array
(
[text] => What Is a Spanning Tree in Graph Theory
[displayText] => What Is a Spanning Tree in Graph Theory
[webSearchUrl] => https://www.bing.com/images/search?q=What+Is+a+Spanning+Tree+in+Graph+Theory&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5891.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=What+Is+a+Spanning+Tree+in+Graph+Theory
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=What+Is+a+Spanning+Tree+in+Graph+Theory&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[39] => Array
(
[text] => Kruskal Algorithm GIF
[displayText] => Kruskal Algorithm GIF
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal+Algorithm+GIF&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5893.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal+Algorithm+GIF
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Kruskal+Algorithm+GIF&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[40] => Array
(
[text] => Algoritum Kruskal
[displayText] => Algoritum Kruskal
[webSearchUrl] => https://www.bing.com/images/search?q=Algoritum+Kruskal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5895.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Algoritum+Kruskal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Algoritum+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[41] => Array
(
[text] => Real Life Algorithm Examples
[displayText] => Real Life Algorithm Examples
[webSearchUrl] => https://www.bing.com/images/search?q=Real+Life+Algorithm+Examples&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5897.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Real+Life+Algorithm+Examples
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Real+Life+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[42] => Array
(
[text] => Medical Algorithm Examples
[displayText] => Medical Algorithm Examples
[webSearchUrl] => https://www.bing.com/images/search?q=Medical+Algorithm+Examples&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5899.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Medical+Algorithm+Examples
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Medical+Algorithm+Examples&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[43] => Array
(
[text] => Time Graph of Kruskal Algorithm
[displayText] => Time Graph of Kruskal Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=Time+Graph+of+Kruskal+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5901.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Time+Graph+of+Kruskal+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Time+Graph+of+Kruskal+Algorithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[44] => Array
(
[text] => Kruskl Algorithm Properties Image
[displayText] => Kruskl Algorithm Properties Image
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskl+Algorithm+Properties+Image&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5903.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskl+Algorithm+Properties+Image
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Kruskl+Algorithm+Properties+Image&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[45] => Array
(
[text] => Thuật Toán Kruskal
[displayText] => Thuật Toán Kruskal
[webSearchUrl] => https://www.bing.com/images/search?q=Thu%E1%BA%ADt+To%C3%A1n+Kruskal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5905.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Thu%E1%BA%ADt+To%C3%A1n+Kruskal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Thu%e1%ba%adt+To%c3%a1n+Kruskal&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[46] => Array
(
[text] => Kruskal's Algorithm Image in Blue Background
[displayText] => Kruskal's Algorithm Image in Blue Background
[webSearchUrl] => https://www.bing.com/images/search?q=Kruskal%27s+Algorithm+Image+in+Blue+Background&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5907.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Kruskal%27s+Algorithm+Image+in+Blue+Background
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Kruskal%27s+Algorithm+Image+in+Blue+Background&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[47] => Array
(
[text] => Prim's Algorithm Table
[displayText] => Prim's Algorithm Table
[webSearchUrl] => https://www.bing.com/images/search?q=Prim%27s+Algorithm+Table&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5909.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Prim%27s+Algorithm+Table
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Prim%27s+Algorithm+Table&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[48] => Array
(
[text] => Flowchart for Implementation of Kruskal Algorithm
[displayText] => Flowchart for Implementation of Kruskal Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=Flowchart+for+Implementation+of+Kruskal+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5911.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Flowchart+for+Implementation+of+Kruskal+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Flowchart+for+Implementation+of+Kruskal+Algorithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[49] => Array
(
[text] => Small Examples of Kruskal's Algorithm
[displayText] => Small Examples of Kruskal's Algorithm
[webSearchUrl] => https://www.bing.com/images/search?q=Small+Examples+of+Kruskal%27s+Algorithm&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5913.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Small+Examples+of+Kruskal%27s+Algorithm
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Small+Examples+of+Kruskal%27s+Algorithm&r=0&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
)
[createdate] => 1777799892527
)
[json_error] => No error
[products_count] => 120
[related_searches_count] => 50
[first_product_sample] => Array
(
[name] => Fillable Online Coumadin Dosing Algorithm For INR of 2-3 Fax Email ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Q8nyPSsxUxkBLFFs_-nsawAAAA?r=0&pid=Api
[datePublished] => 2022-08-14T15:32:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.pdffiller.com/preview/207/156/207156521.png
[hostPageUrl] => https://www.pdffiller.com/207156521-CoumadinDosingAlgorithm2pdf-Coumadin-Dosing-Algorithm-For-INR-of-2-3-
[contentSize] => 6581 B
[width] => 298
[height] => 386
[cDNContentUrl] => https://th.bing.com/th/id/R.43c9f23d2b315319012c516cffe9ec6b?rik=tOuP9O7HiNZtmg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2DAF230F00D7728B00A49A6DD688C7EEF48FEBB4
[accentColor] => 3B3B3B
)
)
[skipped_products] => Array
(
)
)
How to Discover Better Kruskal S Algorithm Example Options
Try combining terms like fit, fabric, or occasion with your core query. For example, add words like oversized, linen, party, office, or wedding to get more targeted fashion product discovery results.
Search Help
Are these results from one store only?
No, Styleberry is a discovery layer that surfaces fashion products from multiple sources to simplify comparison.
Can I search using occasion terms like office or wedding?
Yes, occasion keywords often produce stronger and more relevant results for fashion discovery.