Using dijkstra on unconnected graph

From: aalness_at_[hidden]
Date: 2001-01-10 16:03:54

Hello,

I am using dijkstra_shortest_paths() on an unconnected graph, in order to
find out if the source and dest im looking at are even connected is the
correct thing to do to check for a black_color value for the dest color?

Also, if I create an undirected adjacency_list that uses vectors for both
my vertex and edge data structures will add_edge()'s bool return value be set to
false if I try and do a duplicate add?

Thanks in advance.

-Andrew

------------------------
Andrew Alness
Software Engineer
Sonicity, Inc.
http://www.sonicity.com