Boost Users :
Subject: [Boost-users] [BGL]Why the output of algorithms are vertex sequence(PredecessorMap)? How about parallel edges??
From: Li Ning (Ning.c.Li_at_[hidden])
Date: 2009-05-07 23:14:05
For example, a graph has 2 nodes: A & B. There are 2 edges form A to B which
are edge1 & edge2. edge1 has weight 1, edge2 has weight 2. Then the shortest
path form A to B is: vertex A---edge1---vertex B. But the default output of
all algorithm is vertex sequence. Why? How to get the edge sequence??
I have noticed vistor.hpp has a class edge_predecessor_recorder, but I don't
know how to use it.
Anybody give me a hint?
-- View this message in context: http://www.nabble.com/-BGL-Why-the-output-of-algorithms-are-vertex-sequence%28PredecessorMap%29--How-about-parallel-edges---tp23439356p23439356.html Sent from the Boost - Users mailing list archive at Nabble.com.
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net