TORSCHE Scheduling
Toolbox for Matlab

Description

G_HAM=HAMILTONCIRCUIT(G) solves the problem for directed graph G. Both G and G_HAM are Graph objects. Route cost is stored in Graph_out.UserParam.RouteCost

G_HAM=HAMILTONCIRCUIT(G,EDGESDIRECTION) defines direction of edges, if parameter EDGESDIRECTION is 'u' then the input graph is considered as undirected graph. When the parametr is 'd' the input graph is considered as directed graph (default).

See also

EDGES2PARAM, PARAM2EDGES, GRAPH/GRAPH, EDGES2MATRIXPARAM