{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Graph Algorithms : Graph\/Network Traversal Algorithms","description":"Book Draft PDF and Powerpoint Slides available at http:\/\/dmml.asu.edu\/smm","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/935f7b6f44bc10ae\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='540' id='ccShare267' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/267' allowfullscreen><\/iframe>","type":"video","width":720,"height":540,"duration":"40:02","index":{"item_1":{"title":"Graph Essentials - Graph Algorithms : Graph\/Network Traversal Algorithms","time":"0","indent":"0","sn":"1"},"item_2":{"title":"Graph Algorithms(\u5716\u5f62\u6f14\u7b97\u6cd5)","time":"21650","indent":"0","sn":"2"},"item_3":{"title":"Graph\/Network Traversal Algorithms(\u5716\u5f62\/\u6a39\u72c0\u5de1\u8a2a\u6f14\u7b97\u6cd5)","time":"26400","indent":"0","sn":"3"},"item_4":{"title":"Graph\/Tree Traversal","time":"56300","indent":"0","sn":"4"},"item_5":{"title":"Depth-First Search (DFS)","time":"149050","indent":"0","sn":"5"},"item_6":{"title":"Depth-First Search (DFS): An Example","time":"299900","indent":"0","sn":"6"},"item_7":{"title":"DFS Algorithm","time":"494250","indent":"0","sn":"7"},"item_8":{"title":"Breadth-First Search (BFS)","time":"701150","indent":"0","sn":"8"},"item_9":{"title":"Breadth-First Search (BFS)","time":"756900","indent":"0","sn":"9"},"item_10":{"title":"BFS Algorithm","time":"898100","indent":"0","sn":"10"},"item_11":{"title":"Shortest Path","time":"937300","indent":"0","sn":"11"},"item_12":{"title":"Dijkstra\u2019s Algorithm Execution Example","time":"1097000","indent":"0","sn":"12"},"item_13":{"title":"Dijkstra\u2019s Algorithm: Finding the shortest path","time":"1468000","indent":"0","sn":"13"},"item_14":{"title":"Dijkstra\u2019s Algorithm","time":"1774450","indent":"0","sn":"14"},"item_15":{"title":"Prim\u2019s Algorithm: Finding Minimum Spanning Tree","time":"1859200","indent":"0","sn":"15"},"item_16":{"title":"Prim\u2019s Algorithm Execution Example","time":"2042900","indent":"0","sn":"16"},"item_17":{"title":"Bridge Detection","time":"2231000","indent":"0","sn":"17"}},"resolution":{"playtype":"fs","subtype":"","src":"1024x768","mp4":"720x540","mp4_hd":"","mp4_4k":"","mp4_1920":"","mp4_src":"1024x768","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/935f7b6f44bc10ae\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/935f7b6f44bc10ae\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/935f7b6f44bc10ae\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/935f7b6f44bc10ae","status":true}