Boost logo

Boost :

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-03-18 22:57:50

oops, I originally just hit "reply" and sent this to boost_at_[hidden]
instead of the new boost_at_[hidden] :)


As a first approach, I would trying using the filtered_graph class. This
class adapts a graph by filtering out vertices and edges according to the
predicates that you specify. In this case, you would create a vertex
predicate that returns whether the vertex is in the subset you are
interested in. You can then apply Dijkstra to the filtered_graph. If this
approach doesn't work for you, we can talk more...


On Mon, 18 Mar 2002, madlor wrote:
madlor> hello everyone,
madlor> just a quick and (hopefully) easy question:
madlor> how do I use BGL Dijkstra algorithm to compute shortest path from a
madlor> given vertex and all vertexes in a subset of graph's vertexes??
madlor> i have got really big graphs (from streets network), some milion of
madlor> edges and vertexes, and onlòy need to compute shortest path between
madlor> subsets of vertexes
madlor> sorry for my bad english(i'm italian..)

 Jeremy Siek
 Ph.D. Student, Indiana Univ. B'ton email: jsiek_at_[hidden]
 C++ Booster ( office phone: (812) 855-3608

Boost list run by bdawes at, gregod at, cpdaniel at, john at