{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Algorithm_spanningtree","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1fa331ed0f935a54\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare951' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/951' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"16:49","index":{"item_1":{"title":"Minimum Spanning Tree","time":"0","indent":"0","sn":"1"},"item_2":{"title":"Minimum Spanning Trees (MST)","time":"5330","indent":"0","sn":"2"},"item_3":{"title":"An Example of MST","time":"105880","indent":"0","sn":"3"},"item_4":{"title":"Kruskal\u2019s Algorithm for Finding MST","time":"158080","indent":"0","sn":"4"},"item_5":{"title":"An example of Kruskal\u2019s algorithm","time":"325530","indent":"0","sn":"5"},"item_6":{"title":"The Details for Constructing an MST","time":"514630","indent":"0","sn":"6"},"item_7":{"title":"Slide 8","time":"651230","indent":"0","sn":"7"},"item_8":{"title":"Time Complexity of Kruskal\u2019s Algorithm","time":"730430","indent":"0","sn":"8"}},"resolution":{"playtype":"fs","subtype":"","src":"1280x720","mp4":"720x404","mp4_hd":"1280x720","mp4_4k":"","mp4_1920":"","mp4_src":"","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1fa331ed0f935a54\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1fa331ed0f935a54\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1fa331ed0f935a54\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1fa331ed0f935a54","status":true}