Boost logo

Boost :

From: madlor (madlor_at_[hidden])
Date: 2002-03-18 14:57:16

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

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