| Author |
Comment/Response |
GS
|
 10/30/11 11:12am
In Combinatorica there is a function to compute all Hamilton paths in a graph. For relatively dense graphs this can be an overwhelming amount of output. What I need is a program that takes as input a pair of vertices in the graph and outputs a Hamilton path if one exists or a statement that none exists if that is the case. I am not a programmer so will not be able to use a suggestion that involves coding.
URL: , |
|
