Functions

Current Functions exported by Boost::Graph v1.4

• Dijkstra's Shortest Paths
• Johnsons All Pairs Shortest Paths
• Floyd-Warshall All Pairs Shortest Paths
• Connected Components

Functions that we'd like to see in Boost::Graph v1.4_005

Boyd

• clear_vertex(), remove_vertex() & remove_edge() (how were these 3 not an issue before?) They are found in Mutable Graph
• Betweeness centrality
• clustering co-efficients of vertices/network

Functions available in boost/graph 1.54

• Dijkstra's Shortest Paths
• Bellman-Ford Shortest Paths
• Johnson's All-Pairs Shortest Paths
• Kruskal's Minimum Spanning Tree
• Prim's Minimum Spanning Tree
• Connected Components
• Strongly Connected Components
• Dynamic Connected Components (using Disjoint Sets)
• Topological Sort
• Transpose
• Reverse Cuthill Mckee Ordering
• Smallest Last Vertex Ordering
• Sequential Vertex Coloring