30 Mar
2004
30 Mar
'04
4:33 p.m.
Is there an easy way to find out all of, for instance, the vertex properties associated with a graph? What I'm looking for is something like the following: <pseduocode> vector<properties> my_vertex_properties; property_iterator pi, last; for(tie(pi, last) = vertex_property_list(Graph); pi != last; ++pi) my_vertex_properties.push_back(*pi); </pseudocode> How about it? Does anything like this exist or am I just daydreaming again? Thanks. -- Stephen W. Juranich Science Applications Intl. Corp. (SAIC) (520) 570-7706