{"algorithm":"dfs","about":["Depth-first search goes from the vertex it is at to a neighbor it hasn't seen, and from there to the next, as deep as it can. The vertices it has gone through form the search path. When the vertex at the end of the path has no neighbor left to try, the search finishes it and backs up one vertex. Each vertex gets a discovery time when the search enters it and a finish time when it leaves, and the times of a vertex nest inside the times of the vertex it was reached from, like parentheses.","traverse.DFSEvents reports each step as an event and sorts every edge it meets into four kinds. A tree edge leads to a new vertex. A back edge leads to a vertex still on the search path, so it closes a loop. A forward edge leads to a finished vertex discovered after the one the search is at, a descendant reached another way. A cross edge leads to a finished vertex discovered before it, in another branch. An undirected graph has only tree and back edges, and the edge back to the vertex a vertex was reached from is the tree edge itself, not a back edge.","The search costs O(V+E). Use it to find everything a vertex can reach, to explore a maze one branch at a time, or for the back edges, which are how connectivity.FindCycle and the topological sorts by finish time work. The path it follows is rarely the shortest one. For the fewest edges, use Breadth-first."],"template":{"id":"karate-club","name":"Karate club","description":"The 34 members of a university karate club, numbered 1 to 34 as in the study. Each edge joins two members who also spent time together outside the club's classes and meetings. A dispute between the instructor (1) and an officer (34) split the club in two, and most members sit near the side they joined.","family":"undirected","directed":false,"weighted":false,"acyclic":false,"vertices":[{"id":"1","x":590,"y":680},{"id":"2","x":640,"y":560},{"id":"3","x":420,"y":520},{"id":"4","x":470,"y":760},{"id":"5","x":680,"y":850},{"id":"6","x":750,"y":860},{"id":"7","x":820,"y":760},{"id":"8","x":390,"y":660},{"id":"9","x":520,"y":430},{"id":"10","x":590,"y":230},{"id":"11","x":590,"y":930},{"id":"12","x":400,"y":900},{"id":"13","x":490,"y":890},{"id":"14","x":590,"y":480},{"id":"15","x":460,"y":80},{"id":"16","x":380,"y":70},{"id":"17","x":950,"y":940},{"id":"18","x":830,"y":560},{"id":"19","x":540,"y":110},{"id":"20","x":770,"y":450},{"id":"21","x":90,"y":220},{"id":"22","x":820,"y":640},{"id":"23","x":290,"y":70},{"id":"24","x":120,"y":300},{"id":"25","x":120,"y":690},{"id":"26","x":50,"y":570},{"id":"27","x":220,"y":60},{"id":"28","x":210,"y":490},{"id":"29","x":390,"y":440},{"id":"30","x":170,"y":190},{"id":"31","x":640,"y":300},{"id":"32","x":280,"y":570},{"id":"33","x":250,"y":340},{"id":"34","x":440,"y":260}],"edges":[{"from":"1","to":"2"},{"from":"1","to":"3"},{"from":"1","to":"4"},{"from":"1","to":"5"},{"from":"1","to":"6"},{"from":"1","to":"7"},{"from":"1","to":"8"},{"from":"1","to":"9"},{"from":"1","to":"11"},{"from":"1","to":"12"},{"from":"1","to":"13"},{"from":"1","to":"14"},{"from":"1","to":"18"},{"from":"1","to":"20"},{"from":"1","to":"22"},{"from":"1","to":"32"},{"from":"2","to":"3"},{"from":"2","to":"4"},{"from":"2","to":"8"},{"from":"2","to":"14"},{"from":"2","to":"18"},{"from":"2","to":"20"},{"from":"2","to":"22"},{"from":"2","to":"31"},{"from":"3","to":"4"},{"from":"3","to":"8"},{"from":"3","to":"9"},{"from":"3","to":"10"},{"from":"3","to":"14"},{"from":"3","to":"28"},{"from":"3","to":"29"},{"from":"3","to":"33"},{"from":"4","to":"8"},{"from":"4","to":"13"},{"from":"4","to":"14"},{"from":"5","to":"7"},{"from":"5","to":"11"},{"from":"6","to":"7"},{"from":"6","to":"11"},{"from":"6","to":"17"},{"from":"7","to":"17"},{"from":"9","to":"31"},{"from":"9","to":"33"},{"from":"9","to":"34"},{"from":"10","to":"34"},{"from":"14","to":"34"},{"from":"15","to":"33"},{"from":"15","to":"34"},{"from":"16","to":"33"},{"from":"16","to":"34"},{"from":"19","to":"33"},{"from":"19","to":"34"},{"from":"20","to":"34"},{"from":"21","to":"33"},{"from":"21","to":"34"},{"from":"23","to":"33"},{"from":"23","to":"34"},{"from":"24","to":"26"},{"from":"24","to":"28"},{"from":"24","to":"30"},{"from":"24","to":"33"},{"from":"24","to":"34"},{"from":"25","to":"26"},{"from":"25","to":"28"},{"from":"25","to":"32"},{"from":"26","to":"32"},{"from":"27","to":"30"},{"from":"27","to":"34"},{"from":"28","to":"34"},{"from":"29","to":"32"},{"from":"29","to":"34"},{"from":"30","to":"33"},{"from":"30","to":"34"},{"from":"31","to":"33"},{"from":"31","to":"34"},{"from":"32","to":"33"},{"from":"32","to":"34"},{"from":"33","to":"34"}],"source":"W. W. Zachary, \"An information flow model for conflict and fission in small groups\", Journal of Anthropological Research 33 (1977).","details":{"vertices":34,"edges":78,"directed":false,"weighted":false,"acyclic":false,"negativeWeights":false,"density":0.13903743315508021,"degree":{"min":1,"avg":4.588235294117647,"max":17},"selfLoops":0,"components":1}},"problem":"Starting with the instructor, member 1, follow a chain of members who spent time together as far as it goes, then go back and try the next, until everyone linked to the instructor is found.","params":{"start":"1"},"result":{"kind":"order","vertices":["1","2","3","4","8","13","14","34","9","31","33","15","16","19","21","23","24","26","25","28","32","29","30","27","10","20","18","22","5","7","6","11","17","12"]},"answer":"From 1, depth-first visits 34 vertices: 1, 2, 3, 4, 8, 13, 14, 34, 9, 31, and so on to 12. It met 33 tree edges and 45 back edges.","legend":{"vertex":[{"id":"idle","label":"Not reached","color":"#64748B","shape":"hollow"},{"id":"current","label":"On the search path","color":"#56B4E9","shape":"ring"},{"id":"done","label":"Finished","color":"#009E73","shape":"filled"}],"edge":[{"id":"idle","label":"Edge","color":"#475569","shape":"line"},{"id":"tree","label":"Tree edge, to a new vertex","color":"#009E73","shape":"thick"},{"id":"back","label":"Back edge, to the search path","color":"#D55E00","shape":"dashed"},{"id":"forward","label":"Forward edge, to a finished descendant","color":"#56B4E9","shape":"dotted"},{"id":"cross","label":"Cross edge, to another branch","color":"#E69F00","shape":"line"}],"panels":[{"id":"times","title":"Discovered / finished","kind":"table"},{"id":"path","title":"Search path, start first","kind":"list"},{"id":"order","title":"Discovery order","kind":"list"}]},"steps":[{"say":"Start at 1. Discover it at time 1, and it begins the search path.","ops":[{"v":"1","state":"current"},{"panel":"times","set":{"1":"1"}},{"panel":"path","list":[{"key":"1"}]},{"panel":"order","list":[{"key":"1"}]}]},{"say":"1 to 2 leads to a new vertex, so it is a tree edge. Discover 2 at time 2, and it joins the search path.","ops":[{"e":["1","2"],"state":"tree"},{"v":"2","state":"current"},{"panel":"times","set":{"2":"2"}},{"panel":"path","list":[{"key":"1"},{"key":"2"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"}]}]},{"say":"2 to 1 leads to 1, which is still on the search path, but it is the tree edge 2 was discovered by, seen from the other end. On an undirected graph that isn't a back edge, so the search skips it, here and every time it comes up."},{"say":"2 to 3 leads to a new vertex, so it is a tree edge. Discover 3 at time 3, and it joins the search path.","ops":[{"e":["2","3"],"state":"tree"},{"v":"3","state":"current"},{"panel":"times","set":{"3":"3"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"}]}]},{"say":"3 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 3 and this edge make a loop.","ops":[{"e":["3","1"],"state":"back"}]},{"say":"3 to 4 leads to a new vertex, so it is a tree edge. Discover 4 at time 4, and it joins the search path.","ops":[{"e":["3","4"],"state":"tree"},{"v":"4","state":"current"},{"panel":"times","set":{"4":"4"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"}]}]},{"say":"4 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 4 and this edge make a loop.","ops":[{"e":["4","1"],"state":"back"}]},{"say":"4 to 2 leads to 2, which is still on the search path, so it is a back edge. The path from 2 to 4 and this edge make a loop.","ops":[{"e":["4","2"],"state":"back"}]},{"say":"4 to 8 leads to a new vertex, so it is a tree edge. Discover 8 at time 5, and it joins the search path.","ops":[{"e":["4","8"],"state":"tree"},{"v":"8","state":"current"},{"panel":"times","set":{"8":"5"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"}]}]},{"say":"8 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 8 and this edge make a loop.","ops":[{"e":["8","1"],"state":"back"}]},{"say":"8 to 2 leads to 2, which is still on the search path, so it is a back edge. The path from 2 to 8 and this edge make a loop.","ops":[{"e":["8","2"],"state":"back"}]},{"say":"8 to 3 leads to 3, which is still on the search path, so it is a back edge. The path from 3 to 8 and this edge make a loop.","ops":[{"e":["8","3"],"state":"back"}]},{"say":"8 has no neighbor left to try. Finish it at time 6 and back up to 4.","ops":[{"v":"8","state":"done"},{"panel":"times","set":{"8":"5/6"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"}]}]},{"say":"4 to 13 leads to a new vertex, so it is a tree edge. Discover 13 at time 7, and it joins the search path.","ops":[{"e":["4","13"],"state":"tree"},{"v":"13","state":"current"},{"panel":"times","set":{"13":"7"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"13"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"}]}]},{"say":"13 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 13 and this edge make a loop.","ops":[{"e":["13","1"],"state":"back"}]},{"say":"13 has no neighbor left to try. Finish it at time 8 and back up to 4.","ops":[{"v":"13","state":"done"},{"panel":"times","set":{"13":"7/8"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"}]}]},{"say":"4 to 14 leads to a new vertex, so it is a tree edge. Discover 14 at time 9, and it joins the search path.","ops":[{"e":["4","14"],"state":"tree"},{"v":"14","state":"current"},{"panel":"times","set":{"14":"9"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"}]}]},{"say":"14 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 14 and this edge make a loop.","ops":[{"e":["14","1"],"state":"back"}]},{"say":"14 to 2 leads to 2, which is still on the search path, so it is a back edge. The path from 2 to 14 and this edge make a loop.","ops":[{"e":["14","2"],"state":"back"}]},{"say":"14 to 3 leads to 3, which is still on the search path, so it is a back edge. The path from 3 to 14 and this edge make a loop.","ops":[{"e":["14","3"],"state":"back"}]},{"say":"14 to 34 leads to a new vertex, so it is a tree edge. Discover 34 at time 10, and it joins the search path.","ops":[{"e":["14","34"],"state":"tree"},{"v":"34","state":"current"},{"panel":"times","set":{"34":"10"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"}]}]},{"say":"34 to 9 leads to a new vertex, so it is a tree edge. Discover 9 at time 11, and it joins the search path.","ops":[{"e":["34","9"],"state":"tree"},{"v":"9","state":"current"},{"panel":"times","set":{"9":"11"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"}]}]},{"say":"9 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 9 and this edge make a loop.","ops":[{"e":["9","1"],"state":"back"}]},{"say":"9 to 3 leads to 3, which is still on the search path, so it is a back edge. The path from 3 to 9 and this edge make a loop.","ops":[{"e":["9","3"],"state":"back"}]},{"say":"9 to 31 leads to a new vertex, so it is a tree edge. Discover 31 at time 12, and it joins the search path.","ops":[{"e":["9","31"],"state":"tree"},{"v":"31","state":"current"},{"panel":"times","set":{"31":"12"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"}]}]},{"say":"31 to 2 leads to 2, which is still on the search path, so it is a back edge. The path from 2 to 31 and this edge make a loop.","ops":[{"e":["31","2"],"state":"back"}]},{"say":"31 to 33 leads to a new vertex, so it is a tree edge. Discover 33 at time 13, and it joins the search path.","ops":[{"e":["31","33"],"state":"tree"},{"v":"33","state":"current"},{"panel":"times","set":{"33":"13"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"33 to 3 leads to 3, which is still on the search path, so it is a back edge. The path from 3 to 33 and this edge make a loop.","ops":[{"e":["33","3"],"state":"back"}]},{"say":"33 to 9 leads to 9, which is still on the search path, so it is a back edge. The path from 9 to 33 and this edge make a loop.","ops":[{"e":["33","9"],"state":"back"}]},{"say":"33 to 15 leads to a new vertex, so it is a tree edge. Discover 15 at time 14, and it joins the search path.","ops":[{"e":["33","15"],"state":"tree"},{"v":"15","state":"current"},{"panel":"times","set":{"15":"14"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"}]}]},{"say":"15 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 15 and this edge make a loop.","ops":[{"e":["15","34"],"state":"back"}]},{"say":"15 has no neighbor left to try. Finish it at time 15 and back up to 33.","ops":[{"v":"15","state":"done"},{"panel":"times","set":{"15":"14/15"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"33 to 16 leads to a new vertex, so it is a tree edge. Discover 16 at time 16, and it joins the search path.","ops":[{"e":["33","16"],"state":"tree"},{"v":"16","state":"current"},{"panel":"times","set":{"16":"16"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"16"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"}]}]},{"say":"16 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 16 and this edge make a loop.","ops":[{"e":["16","34"],"state":"back"}]},{"say":"16 has no neighbor left to try. Finish it at time 17 and back up to 33.","ops":[{"v":"16","state":"done"},{"panel":"times","set":{"16":"16/17"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"33 to 19 leads to a new vertex, so it is a tree edge. Discover 19 at time 18, and it joins the search path.","ops":[{"e":["33","19"],"state":"tree"},{"v":"19","state":"current"},{"panel":"times","set":{"19":"18"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"19"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"}]}]},{"say":"19 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 19 and this edge make a loop.","ops":[{"e":["19","34"],"state":"back"}]},{"say":"19 has no neighbor left to try. Finish it at time 19 and back up to 33.","ops":[{"v":"19","state":"done"},{"panel":"times","set":{"19":"18/19"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"33 to 21 leads to a new vertex, so it is a tree edge. Discover 21 at time 20, and it joins the search path.","ops":[{"e":["33","21"],"state":"tree"},{"v":"21","state":"current"},{"panel":"times","set":{"21":"20"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"21"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"}]}]},{"say":"21 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 21 and this edge make a loop.","ops":[{"e":["21","34"],"state":"back"}]},{"say":"21 has no neighbor left to try. Finish it at time 21 and back up to 33.","ops":[{"v":"21","state":"done"},{"panel":"times","set":{"21":"20/21"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"33 to 23 leads to a new vertex, so it is a tree edge. Discover 23 at time 22, and it joins the search path.","ops":[{"e":["33","23"],"state":"tree"},{"v":"23","state":"current"},{"panel":"times","set":{"23":"22"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"23"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"}]}]},{"say":"23 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 23 and this edge make a loop.","ops":[{"e":["23","34"],"state":"back"}]},{"say":"23 has no neighbor left to try. Finish it at time 23 and back up to 33.","ops":[{"v":"23","state":"done"},{"panel":"times","set":{"23":"22/23"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"33 to 24 leads to a new vertex, so it is a tree edge. Discover 24 at time 24, and it joins the search path.","ops":[{"e":["33","24"],"state":"tree"},{"v":"24","state":"current"},{"panel":"times","set":{"24":"24"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"}]}]},{"say":"24 to 26 leads to a new vertex, so it is a tree edge. Discover 26 at time 25, and it joins the search path.","ops":[{"e":["24","26"],"state":"tree"},{"v":"26","state":"current"},{"panel":"times","set":{"26":"25"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"}]}]},{"say":"26 to 25 leads to a new vertex, so it is a tree edge. Discover 25 at time 26, and it joins the search path.","ops":[{"e":["26","25"],"state":"tree"},{"v":"25","state":"current"},{"panel":"times","set":{"25":"26"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"},{"key":"25"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"}]}]},{"say":"25 to 28 leads to a new vertex, so it is a tree edge. Discover 28 at time 27, and it joins the search path.","ops":[{"e":["25","28"],"state":"tree"},{"v":"28","state":"current"},{"panel":"times","set":{"28":"27"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"}]}]},{"say":"28 to 3 leads to 3, which is still on the search path, so it is a back edge. The path from 3 to 28 and this edge make a loop.","ops":[{"e":["28","3"],"state":"back"}]},{"say":"28 to 24 leads to 24, which is still on the search path, so it is a back edge. The path from 24 to 28 and this edge make a loop.","ops":[{"e":["28","24"],"state":"back"}]},{"say":"28 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 28 and this edge make a loop.","ops":[{"e":["28","34"],"state":"back"}]},{"say":"28 has no neighbor left to try. Finish it at time 28 and back up to 25.","ops":[{"v":"28","state":"done"},{"panel":"times","set":{"28":"27/28"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"},{"key":"25"}]}]},{"say":"25 to 32 leads to a new vertex, so it is a tree edge. Discover 32 at time 29, and it joins the search path.","ops":[{"e":["25","32"],"state":"tree"},{"v":"32","state":"current"},{"panel":"times","set":{"32":"29"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"32"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"}]}]},{"say":"32 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 32 and this edge make a loop.","ops":[{"e":["32","1"],"state":"back"}]},{"say":"32 to 26 leads to 26, which is still on the search path, so it is a back edge. The path from 26 to 32 and this edge make a loop.","ops":[{"e":["32","26"],"state":"back"}]},{"say":"32 to 29 leads to a new vertex, so it is a tree edge. Discover 29 at time 30, and it joins the search path.","ops":[{"e":["32","29"],"state":"tree"},{"v":"29","state":"current"},{"panel":"times","set":{"29":"30"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"32"},{"key":"29"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"}]}]},{"say":"29 to 3 leads to 3, which is still on the search path, so it is a back edge. The path from 3 to 29 and this edge make a loop.","ops":[{"e":["29","3"],"state":"back"}]},{"say":"29 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 29 and this edge make a loop.","ops":[{"e":["29","34"],"state":"back"}]},{"say":"29 has no neighbor left to try. Finish it at time 31 and back up to 32.","ops":[{"v":"29","state":"done"},{"panel":"times","set":{"29":"30/31"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"32"}]}]},{"say":"32 to 33 leads to 33, which is still on the search path, so it is a back edge. The path from 33 to 32 and this edge make a loop.","ops":[{"e":["32","33"],"state":"back"}]},{"say":"32 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 32 and this edge make a loop.","ops":[{"e":["32","34"],"state":"back"}]},{"say":"32 has no neighbor left to try. Finish it at time 32 and back up to 25.","ops":[{"v":"32","state":"done"},{"panel":"times","set":{"32":"29/32"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"},{"key":"25"}]}]},{"say":"25 has no neighbor left to try. Finish it at time 33 and back up to 26.","ops":[{"v":"25","state":"done"},{"panel":"times","set":{"25":"26/33"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"26"}]}]},{"say":"26 has no neighbor left to try. Finish it at time 34 and back up to 24.","ops":[{"v":"26","state":"done"},{"panel":"times","set":{"26":"25/34"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"}]}]},{"say":"24 to 30 leads to a new vertex, so it is a tree edge. Discover 30 at time 35, and it joins the search path.","ops":[{"e":["24","30"],"state":"tree"},{"v":"30","state":"current"},{"panel":"times","set":{"30":"35"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"30"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"}]}]},{"say":"30 to 27 leads to a new vertex, so it is a tree edge. Discover 27 at time 36, and it joins the search path.","ops":[{"e":["30","27"],"state":"tree"},{"v":"27","state":"current"},{"panel":"times","set":{"27":"36"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"30"},{"key":"27"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"}]}]},{"say":"27 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 27 and this edge make a loop.","ops":[{"e":["27","34"],"state":"back"}]},{"say":"27 has no neighbor left to try. Finish it at time 37 and back up to 30.","ops":[{"v":"27","state":"done"},{"panel":"times","set":{"27":"36/37"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"},{"key":"30"}]}]},{"say":"30 to 33 leads to 33, which is still on the search path, so it is a back edge. The path from 33 to 30 and this edge make a loop.","ops":[{"e":["30","33"],"state":"back"}]},{"say":"30 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 30 and this edge make a loop.","ops":[{"e":["30","34"],"state":"back"}]},{"say":"30 has no neighbor left to try. Finish it at time 38 and back up to 24.","ops":[{"v":"30","state":"done"},{"panel":"times","set":{"30":"35/38"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"24"}]}]},{"say":"24 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 24 and this edge make a loop.","ops":[{"e":["24","34"],"state":"back"}]},{"say":"24 has no neighbor left to try. Finish it at time 39 and back up to 33.","ops":[{"v":"24","state":"done"},{"panel":"times","set":{"24":"24/39"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"33 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 33 and this edge make a loop.","ops":[{"e":["33","34"],"state":"back"}]},{"say":"33 has no neighbor left to try. Finish it at time 40 and back up to 31.","ops":[{"v":"33","state":"done"},{"panel":"times","set":{"33":"13/40"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"}]}]},{"say":"31 to 34 leads to 34, which is still on the search path, so it is a back edge. The path from 34 to 31 and this edge make a loop.","ops":[{"e":["31","34"],"state":"back"}]},{"say":"31 has no neighbor left to try. Finish it at time 41 and back up to 9.","ops":[{"v":"31","state":"done"},{"panel":"times","set":{"31":"12/41"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"9"}]}]},{"say":"9 has no neighbor left to try. Finish it at time 42 and back up to 34.","ops":[{"v":"9","state":"done"},{"panel":"times","set":{"9":"11/42"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"}]}]},{"say":"34 to 10 leads to a new vertex, so it is a tree edge. Discover 10 at time 43, and it joins the search path.","ops":[{"e":["34","10"],"state":"tree"},{"v":"10","state":"current"},{"panel":"times","set":{"10":"43"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"10"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"}]}]},{"say":"10 to 3 leads to 3, which is still on the search path, so it is a back edge. The path from 3 to 10 and this edge make a loop.","ops":[{"e":["10","3"],"state":"back"}]},{"say":"10 has no neighbor left to try. Finish it at time 44 and back up to 34.","ops":[{"v":"10","state":"done"},{"panel":"times","set":{"10":"43/44"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"}]}]},{"say":"34 to 20 leads to a new vertex, so it is a tree edge. Discover 20 at time 45, and it joins the search path.","ops":[{"e":["34","20"],"state":"tree"},{"v":"20","state":"current"},{"panel":"times","set":{"20":"45"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"},{"key":"20"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"}]}]},{"say":"20 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 20 and this edge make a loop.","ops":[{"e":["20","1"],"state":"back"}]},{"say":"20 to 2 leads to 2, which is still on the search path, so it is a back edge. The path from 2 to 20 and this edge make a loop.","ops":[{"e":["20","2"],"state":"back"}]},{"say":"20 has no neighbor left to try. Finish it at time 46 and back up to 34.","ops":[{"v":"20","state":"done"},{"panel":"times","set":{"20":"45/46"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"},{"key":"34"}]}]},{"say":"34 has no neighbor left to try. Finish it at time 47 and back up to 14.","ops":[{"v":"34","state":"done"},{"panel":"times","set":{"34":"10/47"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"14"}]}]},{"say":"14 has no neighbor left to try. Finish it at time 48 and back up to 4.","ops":[{"v":"14","state":"done"},{"panel":"times","set":{"14":"9/48"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"}]}]},{"say":"4 has no neighbor left to try. Finish it at time 49 and back up to 3.","ops":[{"v":"4","state":"done"},{"panel":"times","set":{"4":"4/49"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"3"}]}]},{"say":"3 has no neighbor left to try. Finish it at time 50 and back up to 2.","ops":[{"v":"3","state":"done"},{"panel":"times","set":{"3":"3/50"}},{"panel":"path","list":[{"key":"1"},{"key":"2"}]}]},{"say":"2 to 18 leads to a new vertex, so it is a tree edge. Discover 18 at time 51, and it joins the search path.","ops":[{"e":["2","18"],"state":"tree"},{"v":"18","state":"current"},{"panel":"times","set":{"18":"51"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"18"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"},{"key":"18"}]}]},{"say":"18 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 18 and this edge make a loop.","ops":[{"e":["18","1"],"state":"back"}]},{"say":"18 has no neighbor left to try. Finish it at time 52 and back up to 2.","ops":[{"v":"18","state":"done"},{"panel":"times","set":{"18":"51/52"}},{"panel":"path","list":[{"key":"1"},{"key":"2"}]}]},{"say":"2 to 22 leads to a new vertex, so it is a tree edge. Discover 22 at time 53, and it joins the search path.","ops":[{"e":["2","22"],"state":"tree"},{"v":"22","state":"current"},{"panel":"times","set":{"22":"53"}},{"panel":"path","list":[{"key":"1"},{"key":"2"},{"key":"22"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"},{"key":"18"},{"key":"22"}]}]},{"say":"22 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 22 and this edge make a loop.","ops":[{"e":["22","1"],"state":"back"}]},{"say":"22 has no neighbor left to try. Finish it at time 54 and back up to 2.","ops":[{"v":"22","state":"done"},{"panel":"times","set":{"22":"53/54"}},{"panel":"path","list":[{"key":"1"},{"key":"2"}]}]},{"say":"2 has no neighbor left to try. Finish it at time 55 and back up to 1.","ops":[{"v":"2","state":"done"},{"panel":"times","set":{"2":"2/55"}},{"panel":"path","list":[{"key":"1"}]}]},{"say":"1 to 5 leads to a new vertex, so it is a tree edge. Discover 5 at time 56, and it joins the search path.","ops":[{"e":["1","5"],"state":"tree"},{"v":"5","state":"current"},{"panel":"times","set":{"5":"56"}},{"panel":"path","list":[{"key":"1"},{"key":"5"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"},{"key":"18"},{"key":"22"},{"key":"5"}]}]},{"say":"5 to 7 leads to a new vertex, so it is a tree edge. Discover 7 at time 57, and it joins the search path.","ops":[{"e":["5","7"],"state":"tree"},{"v":"7","state":"current"},{"panel":"times","set":{"7":"57"}},{"panel":"path","list":[{"key":"1"},{"key":"5"},{"key":"7"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"},{"key":"18"},{"key":"22"},{"key":"5"},{"key":"7"}]}]},{"say":"7 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 7 and this edge make a loop.","ops":[{"e":["7","1"],"state":"back"}]},{"say":"7 to 6 leads to a new vertex, so it is a tree edge. Discover 6 at time 58, and it joins the search path.","ops":[{"e":["7","6"],"state":"tree"},{"v":"6","state":"current"},{"panel":"times","set":{"6":"58"}},{"panel":"path","list":[{"key":"1"},{"key":"5"},{"key":"7"},{"key":"6"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"},{"key":"18"},{"key":"22"},{"key":"5"},{"key":"7"},{"key":"6"}]}]},{"say":"6 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 6 and this edge make a loop.","ops":[{"e":["6","1"],"state":"back"}]},{"say":"6 to 11 leads to a new vertex, so it is a tree edge. Discover 11 at time 59, and it joins the search path.","ops":[{"e":["6","11"],"state":"tree"},{"v":"11","state":"current"},{"panel":"times","set":{"11":"59"}},{"panel":"path","list":[{"key":"1"},{"key":"5"},{"key":"7"},{"key":"6"},{"key":"11"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"},{"key":"18"},{"key":"22"},{"key":"5"},{"key":"7"},{"key":"6"},{"key":"11"}]}]},{"say":"11 to 1 leads to 1, which is still on the search path, so it is a back edge. The path from 1 to 11 and this edge make a loop.","ops":[{"e":["11","1"],"state":"back"}]},{"say":"11 to 5 leads to 5, which is still on the search path, so it is a back edge. The path from 5 to 11 and this edge make a loop.","ops":[{"e":["11","5"],"state":"back"}]},{"say":"11 has no neighbor left to try. Finish it at time 60 and back up to 6.","ops":[{"v":"11","state":"done"},{"panel":"times","set":{"11":"59/60"}},{"panel":"path","list":[{"key":"1"},{"key":"5"},{"key":"7"},{"key":"6"}]}]},{"say":"6 to 17 leads to a new vertex, so it is a tree edge. Discover 17 at time 61, and it joins the search path.","ops":[{"e":["6","17"],"state":"tree"},{"v":"17","state":"current"},{"panel":"times","set":{"17":"61"}},{"panel":"path","list":[{"key":"1"},{"key":"5"},{"key":"7"},{"key":"6"},{"key":"17"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"},{"key":"18"},{"key":"22"},{"key":"5"},{"key":"7"},{"key":"6"},{"key":"11"},{"key":"17"}]}]},{"say":"17 to 7 leads to 7, which is still on the search path, so it is a back edge. The path from 7 to 17 and this edge make a loop.","ops":[{"e":["17","7"],"state":"back"}]},{"say":"17 has no neighbor left to try. Finish it at time 62 and back up to 6.","ops":[{"v":"17","state":"done"},{"panel":"times","set":{"17":"61/62"}},{"panel":"path","list":[{"key":"1"},{"key":"5"},{"key":"7"},{"key":"6"}]}]},{"say":"6 has no neighbor left to try. Finish it at time 63 and back up to 7.","ops":[{"v":"6","state":"done"},{"panel":"times","set":{"6":"58/63"}},{"panel":"path","list":[{"key":"1"},{"key":"5"},{"key":"7"}]}]},{"say":"7 has no neighbor left to try. Finish it at time 64 and back up to 5.","ops":[{"v":"7","state":"done"},{"panel":"times","set":{"7":"57/64"}},{"panel":"path","list":[{"key":"1"},{"key":"5"}]}]},{"say":"5 has no neighbor left to try. Finish it at time 65 and back up to 1.","ops":[{"v":"5","state":"done"},{"panel":"times","set":{"5":"56/65"}},{"panel":"path","list":[{"key":"1"}]}]},{"say":"1 to 12 leads to a new vertex, so it is a tree edge. Discover 12 at time 66, and it joins the search path.","ops":[{"e":["1","12"],"state":"tree"},{"v":"12","state":"current"},{"panel":"times","set":{"12":"66"}},{"panel":"path","list":[{"key":"1"},{"key":"12"}]},{"panel":"order","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"},{"key":"8"},{"key":"13"},{"key":"14"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"26"},{"key":"25"},{"key":"28"},{"key":"32"},{"key":"29"},{"key":"30"},{"key":"27"},{"key":"10"},{"key":"20"},{"key":"18"},{"key":"22"},{"key":"5"},{"key":"7"},{"key":"6"},{"key":"11"},{"key":"17"},{"key":"12"}]}]},{"say":"12 has no neighbor left to try. Finish it at time 67 and back up to 1.","ops":[{"v":"12","state":"done"},{"panel":"times","set":{"12":"66/67"}},{"panel":"path","list":[{"key":"1"}]}]},{"say":"1 has no neighbor left to try. Finish it at time 68, which ends the search.","ops":[{"v":"1","state":"done"},{"panel":"times","set":{"1":"1/68"}},{"panel":"path","list":[]}]},{"say":"Done. Depth-first discovered 34 vertices from 1. It met 33 tree edges and 45 back edges."}],"traceNote":"","verification":"The steps come from a step-by-step copy of the algorithm. Its result is checked against gograph's on every start.","snippet":"for ev := range traverse.DFSEvents(g, \"1\") {\n\tif ev.Edge != nil {\n\t\tfmt.Println(ev.Kind, ev.Edge.Source().Label(), ev.Edge.Destination().Label())\n\t}\n}"}
