MathGroup Archive 2007

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Possible bug in HamiltonianCycle


It is known that the HamiltonianCycle only works for Undirected Graphs
( not Digraphs).


A Hamiltonian circuit of a graph can be identified using
HamiltonianCycle[g] in the Mathematica package Combinatorica` (which
can be loaded with the command <<Combinatorica`) , which however only
gives correct results for undirected graphs.

Source: http://mathworld.wolfram.com/HamiltonianCircuit.html


  • Prev by Date: Re: Discrepancy between Integrate and NIntegrate
  • Next by Date: Convert nxn matrix to a column vector with (n^2) elements
  • Previous by thread: Re: Possible bug in HamiltonianCycle
  • Next by thread: Re: Possible bug in HamiltonianCycle