<?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>圖走訪: 字接龍(Play on words)</title><description></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/9c9520dc6191f4be/thumb_l.jpg</thumbnail_url><thumbnail_height>360</thumbnail_height><thumbnail_width>640</thumbnail_width><html>&amp;lt;iframe width='720' height='405' id='ccShare620' frameborder='0'  src='http://media.usc.edu.tw/media/e/620' allowfullscreen&amp;gt;&amp;lt;/iframe&amp;gt;</html><type>video</type><width>720</width><height>405</height><duration>1:22:21</duration><index><item_1><title>Play on words字接龍</title><time>0</time><indent>0</indent><sn>1</sn></item_1><item_2><title>話說古早1738年柯尼斯堡的七座橋(Seven Bridges of Königsberg)</title><time>79800</time><indent>0</indent><sn>2</sn></item_2><item_3><title>話說古早1738年數學家尤拉(Euler)</title><time>205600</time><indent>0</indent><sn>3</sn></item_3><item_4><title>一筆畫(Eulerian path)</title><time>335850</time><indent>0</indent><sn>4</sn></item_4><item_5><title>Play on words vs. 一筆畫(Eulerian path)</title><time>475750</time><indent>0</indent><sn>5</sn></item_5><item_6><title>Observation 1: complete or not</title><time>508850</time><indent>0</indent><sn>6</sn></item_6><item_7><title>Observation 2: how many complete graphs</title><time>764800</time><indent>0</indent><sn>7</sn></item_7><item_8><title>Observation 3: test cases</title><time>1018800</time><indent>0</indent><sn>8</sn></item_8><item_9><title>Design Issue 1: head, tail and adjacent</title><time>1212000</time><indent>0</indent><sn>9</sn></item_9><item_10><title>Design Issue 2: detection of incomplete</title><time>1331600</time><indent>0</indent><sn>10</sn></item_10><item_11><title>Design Issue 3.1: detection of two or more disconnected graphs</title><time>1469350</time><indent>0</indent><sn>11</sn></item_11><item_12><title>Design Issue 3.2: detection of two or more disconnected graphs</title><time>1578600</time><indent>0</indent><sn>12</sn></item_12><item_13><title>Design Issue 3.3: detection of two or more disconnected graphs</title><time>1731950</time><indent>0</indent><sn>13</sn></item_13><item_14><title>Coding Part 1</title><time>1831450</time><indent>0</indent><sn>14</sn></item_14><item_15><title>Coding Part 2</title><time>3166400</time><indent>0</indent><sn>15</sn></item_15><item_16><title>Design Issue 3.1: detection of two or more disconnected graphs</title><time>3903250</time><indent>0</indent><sn>16</sn></item_16><item_17><title>Design Issue 3.2: detection of two or more disconnected graphs</title><time>3925050</time><indent>0</indent><sn>17</sn></item_17></index><resolution><playtype>fs</playtype><subtype></subtype><src>1280x720</src><mp4>720x404</mp4><mp4_hd>1280x720</mp4_hd><mp4_4k></mp4_4k><mp4_1920></mp4_1920><mp4_src></mp4_src><mp4_base></mp4_base></resolution><base_image><thumb>http://media.usc.edu.tw/sysdata/doc/9/9c9520dc6191f4be/thumb.jpg</thumb><cover>http://media.usc.edu.tw/sysdata/doc/9/9c9520dc6191f4be/cover.jpg</cover><storyboard>http://media.usc.edu.tw/sysdata/doc/9/9c9520dc6191f4be/video/thumbs/storyboard.jpg</storyboard></base_image><srcFrom></srcFrom><base_url>http://media.usc.edu.tw/sysdata/doc/9/9c9520dc6191f4be</base_url><status>1</status></oembed>
