= User Friendly Graphs and Their Measures =
I am using this place to publish thoughts and updates about the design and implementation of this project. If you happen to be reading this and have some comments about the content, ideas, or questions, please leave them here - I'd like to read them.

== New Graph Classes ==
[wiki:soc/2007/UserFriendlyGraphNewClasses This] is a discussion of the `[un]directed_graph` classes.

== New Algorithms ==
[wiki:soc/2007/UserFriendlyGraphNewAlgorithms This] is a discussion of the several new algorithms (mostly just property computations) of graphs.

 * [wiki:soc/2007/UserFriendlyGraphs/Measures Secondary Measures] - Discussion of secondary measures on graphs.
 * [wiki:soc/2007/UserFriendlyGraphs/Connectivity Connectivity Measures] - Measures of a graph's connectivity.
 * [wiki:soc/2007/UserFriendlyGraphs/Distance Distance Measures] - Distance related measures.
 * [wiki:soc/2007/UserFriendlyGraphs/Cycles Cycles] - Algorithms for finding cycles in graphs.
 * [wiki:soc/2007/UserFriendlyGraphs/Cliques Cliques] - Algorithms for finding cliques in graphs.

== Documentation, Etc. ==
[wiki:soc/2007/UserFriendlyGraphNewDocs This] is a discussion of other (mostly documentary) aspects of the Boost Graph Library.

== Notes ==
This is basically something to take the place of a developer's Journal.

 * [wiki:soc/2007/UserFriendlyGraphs/Indexing Vertex Indexing] - Discusses some approaches to automated vertex indexing and index managements.
 * [wiki:soc/2007/UserFriendlyGraphs/PropertyMaps Property Maps] - Notes and discussion on a more "correct" approach to using property maps.
 * [wiki:soc/2007/UserFriendlyGraphs/Concepts Concepts] - Issues related to concept checking and coverage.

 * I found [http://projects.forked.de/graph-tool graph-tool] today. This seems to be a (actively developed) command-line tool that computes a number of graph statistics. And it uses Boost.Graph - although apparently, a paralellized variant using OpenMP, which requires a GCC patch. Still, it's an interesting project and, from the size of the codebase, looks kind of non-trivial.

 * I've been using [wiki:soc/2007/UserFriendlyGraps/IMDb IMDb] as a test graph for efficiency (because it's big).