graph library: finding single-pair shortest path

27 Dec
27 Dec
9:28 a.m.
I've been thinking about using a visitor to terminate the single-source function once the destination node has been examined, however I am unsure how to handle the termination. I am also unsure as to whether this is the most efficient way of generating a single-pair solution.
the proposed way is to use a visitor, as you said, an throw an exception if the node is examined. hth, moritz -- Moritz Hilger Combinatorial Optimization & Graph Algorithms TU Berlin +49 30 314-25773
6767
Age (days ago)
6767
Last active (days ago)
0 comments
1 participants
participants (1)
-
Matthew Reid
-
moritz Hilger