Re: [jgrapht-users] Non-cyclical Hamiltonian?

[Chris E. <chr...@gm...>]

Determining the existence of Hamiltonian paths in graphs is NP-Complete, so if the graph is not small the only advice I'd offer is "have patience" :-)

Sent from my iPad

On Sep 28, 2013, at 10:13 PM, Darrell Esau <de...@so...> wrote:

> Hi all,
> 
> Is there a way to get a hamiltonian cycle for a given node, but not actually a cycle?
> 
> Given a graph and a starting node, I'd like to find a path that will cover each node exactly once, but not returning to the origin.
> 
> Any advice?
> 
> Thanks!
> -darrell
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most from 
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60133471&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users