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