Ask Your Question

iconjack's profile - activity

2017-09-29 11:54:59 -0600 received badge  Supporter (source)
2016-11-05 11:33:55 -0600 received badge  Nice Question (source)
2016-11-05 05:22:54 -0600 received badge  Student (source)
2016-11-04 16:45:44 -0600 received badge  Famous Question (source)
2016-11-04 16:45:44 -0600 received badge  Notable Question (source)
2016-11-04 16:45:44 -0600 received badge  Popular Question (source)
2016-08-25 15:05:59 -0600 asked a question hamiltonian paths?

A Hamiltonian cycle is a traversal of a graph that visits all vertices just once and then returns to the starting vertex. SageMath can find one for you with G.traveling_salesman_problem. A Hamiltonian path drops the requirement that the path form a cycle. Does SageMath offer a convenient way to list all Hamiltonian paths of a graph?