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