|15 Jun 2012
||MathWorks Classroom Resources Team
MatlabBGL is a Matlab package for working with graphs. It uses the Boost Graph Library to efficiently implement the graph algorithms. MatlabBGL is designed to work with large sparse graphs with hundreds of thousands of nodes.
It Includes Searching Algorithms (breadth first search,depth first search, and astar (A*)), Shortest Path Algorithms (Dijkstra, Bellman-Ford, Johnson, and the Floyd-Warshall), Minimum Spanning Trees (Prim, Kruskal), Components (strongly connected components, biconnected components, and articulation points), Flow (Goldberg's push-relabel maximum-flow minimum-cut algorithm), Statistics (Betweenness Centrality, Clustering Coefficients, and Edge Centrality), Graph Creation (Erdos Reyni (Gnp) Graph, Cycle Graph, Wheel Graph, Star Graph), Planar Graphs (Boyer-Myrvold planarity testing, Chrobak-Payne straight line drawing), Graph Layout (force directed layout, spring based layout, topology filling layout).