{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"\u5716\u8d70\u8a2a: \u5b57\u63a5\u9f8d(Play on words)","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/9c9520dc6191f4be\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare620' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/620' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"1:22:21","index":{"item_1":{"title":"Play on words\u5b57\u63a5\u9f8d","time":"0","indent":"0","sn":"1"},"item_2":{"title":"\u8a71\u8aaa\u53e4\u65e91738\u5e74\u67ef\u5c3c\u65af\u5821\u7684\u4e03\u5ea7\u6a4b(Seven Bridges of K\u00f6nigsberg)","time":"79800","indent":"0","sn":"2"},"item_3":{"title":"\u8a71\u8aaa\u53e4\u65e91738\u5e74\u6578\u5b78\u5bb6\u5c24\u62c9(Euler)","time":"205600","indent":"0","sn":"3"},"item_4":{"title":"\u4e00\u7b46\u756b(Eulerian path)","time":"335850","indent":"0","sn":"4"},"item_5":{"title":"Play on words vs. \u4e00\u7b46\u756b(Eulerian path)","time":"475750","indent":"0","sn":"5"},"item_6":{"title":"Observation 1: complete or not","time":"508850","indent":"0","sn":"6"},"item_7":{"title":"Observation 2: how many complete graphs","time":"764800","indent":"0","sn":"7"},"item_8":{"title":"Observation 3: test cases","time":"1018800","indent":"0","sn":"8"},"item_9":{"title":"Design Issue 1: head, tail and adjacent","time":"1212000","indent":"0","sn":"9"},"item_10":{"title":"Design Issue 2: detection of incomplete","time":"1331600","indent":"0","sn":"10"},"item_11":{"title":"Design Issue 3.1: detection of two or more disconnected graphs","time":"1469350","indent":"0","sn":"11"},"item_12":{"title":"Design Issue 3.2: detection of two or more disconnected graphs","time":"1578600","indent":"0","sn":"12"},"item_13":{"title":"Design Issue 3.3: detection of two or more disconnected graphs","time":"1731950","indent":"0","sn":"13"},"item_14":{"title":"Coding Part 1","time":"1831450","indent":"0","sn":"14"},"item_15":{"title":"Coding Part 2","time":"3166400","indent":"0","sn":"15"},"item_16":{"title":"Design Issue 3.1: detection of two or more disconnected graphs","time":"3903250","indent":"0","sn":"16"},"item_17":{"title":"Design Issue 3.2: detection of two or more disconnected graphs","time":"3925050","indent":"0","sn":"17"}},"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\/9\/9c9520dc6191f4be\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/9c9520dc6191f4be\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/9c9520dc6191f4be\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/9c9520dc6191f4be","status":true}