BGL: dijkstra_shortest_paths and adjacency_list<listS, listS, undirectedS>

From: Jan van der Veen (j.van-der-veen_at_[hidden])
Date: 2000-10-06 11:18:49

Hi Jeremy,

thanks. I´ve been looking for a solution for some time now. Up to
now
I´ve been copying my adjacency_list<listS, listS, undirectedS> to
an
adjacency_list<vecS, vecS, undirectedS> for every call to
dijkstra_shortest_paths.

Jan.