From: Daniel Mitchell
Reply-To: boost-users@lists.boost.org
Yeah, I agree with you. For the first question, I think I'd better to save the strings to an vector and build a relationship between strings in this vector and vertices in the graph.
A related question I want to ask is whether there exist a function call that test whether an edge representing [vertext string("Node1") --> vertext string("Node2") ] exists in a graph.
There's a function edge( u, v, g ) returns the edge between u and v, if it exists. This function is required by the AdjacencyMatrix concept. Thanks for the reply. I have a question for concept requirements. For example, if I declare a Graph representation by typedef adjacency_list
, property > Graph;
How can I know if this Graph satisfies the reqirement of a certain concept, say AdjacencyMatrix ? Thanks again.
D. _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
_________________________________________________________________ Dont just search. Find. Check out the new MSN Search! http://search.msn.click-url.com/go/onm00200636ave/direct/01/