Changes between Version 12 and Version 13 of soc/2007/UserFriendlyGraph

Timestamp:

May 22, 2007, 1:47:43 PM (15 years ago)

Author:

jsiek

Comment:

--

soc/2007/UserFriendlyGraph

@@ -21 +21 @@
 Anyhow, the problem is not that using `listS` as a storage selector really breaks a lot of code (it can), but that its hard to figure out how to create vertex and edge index maps for them. The Dijkstra example has a `listS` example, but it uses property maps instead of bundled properties. Apparently, the solution is to manually initialize the index map. This is both good and bad. First, it's bad because new user's won't really understand why they have to write the same chunk of code over and over. Maybe it would be nice to provide a default `index_vertices()` function and an `index_edges()` functions that do that work for us. On the other hand, It's good because it highlights the instability of indices over descriptors.
 
-(Jeremy: I'd suggest going even further, and have the graph class automatically create and maintain indices for the vertices
- and edges.)
+(Jeremy: I'd suggest going even further, and have the graph class automatically create and maintain indices for the vertices and edges.)
 
 I think the real I'm having with this is that so much of the documentation and so many of the examples operate on the notion that a `vertex_descriptor` is its own index - which it is most definitely not.