python Programming Glossary: tour
Finding a Eulerian Tour http://stackoverflow.com/questions/12447880/finding-a-eulerian-tour if the input graph was # 1 2 2 3 3 1 # A possible Eulerian tour would be 1 2 3 1 I came up with the following solution which.. does seem to work within my test case. def find_eulerian_tour graph tour start_vertex graph 0 0 tour.append start_vertex while.. to work within my test case. def find_eulerian_tour graph tour start_vertex graph 0 0 tour.append start_vertex while len graph..
|
