Publisher review:MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures. The MatlabBGL library fills a hole in Matlab's suite of algorithms. Namely, it provides a rich set of algorithms to work with graphs, as in graph theory graphs. The MatlabBGL package uses Matlab's native sparse matrix type as a graph and provides algorithms that work The algorithms included areSearching: breadth first search,depth first search, and astar (A*) searchShortest Path Algorithms: Dijkstra's algorithm, the Bellman-Ford algorithm, Johnson's algorithm, and the Floyd-Warshall algorithm.Minimum Spanning Trees: Prim's algorithm and Kruskal's algorithm.Components: strongly connected components and biconnected components (and articulation points). Flow Algorithms: Goldberg's push-relabel maximum-flow minimum-cut algorithm. Statistics: Betweenness Centrality, Clustering Coefficients, and Edge CentralityGraph Creation: Erdos Reyni (Gnp) Graph, Cycle Graph, Wheel Graph, Star GraphThe MatlabBGL library fully implements the visitors from the Boost Graph Library to allow native matlab scripts to alter the behavior of the underlying algorithms. See the website for an example of this functionality used to record algorithm behavior. Additional documentation and the MatlabBGL website are at the following URL:http://www.stanford.edu/~dgleich/programs/matlab_bglThe package includes precompiled MEX files for Windows (32-bit), and Linux (32-bit and 64-bit for Matlab 2006b ), and MacOSX (32-bit PPC and 32-bit PPC). The package includes source code to compile on other platforms as well. Requirements: ยท MATLAB Release: R2006b
MatlabBGL 2.1 is a Matlab script for Mathematics scripts design by David Gleich.
It runs on following operating system: .
Operating system:
MatlabBGL 2.1 script details 
