From: SourceForge.net <no...@so...> - 2008-09-24 18:00:46
|
Read and respond to this message at: https://sourceforge.net/forum/message.php?msg_id=5318083 By: e-flat Andrew: So far as the graph is concerned, the vertex object _is_ the identifier. Your example for graph.findEdge(v1, v2) seems to acknowledge this--you need to know about v1 and v2 in order to do that, and you seem to be OK with that, so I may be missing what you're asking. For example, consider the case in which each vertex is an Integer object. In that case, vertex 7 is equal to the Integer with value 7. If you want an identifier for each vertex that allows you to retrieve it given that identifier, you can certainly construct one; one example of this is algorithms.util.Indexer (which creates a bidirectional map between objects and consecutive integers) but you can also create a simple map from String labels to vertices (or edges, or anything else, really). Hope this helps-- Joshua ______________________________________________________________________ You are receiving this email because you elected to monitor this forum. To stop monitoring this forum, login to SourceForge.net and visit: https://sourceforge.net/forum/unmonitor.php?forum_id=252062 |