MatlabBGL: a graph library for Matlab
February 17, 2010 by Admin · Leave a Comment
Filed under: Computational Geometry, Mathematics, Numerical Analysis
Filed under: Computational Geometry, Mathematics, Numerical Analysis
The most complete graph library for Matlab offered by David Gleich.
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 are
- Searching: breadth first search,depth first search, and astar (A*) search
- Shortest 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 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
Additional informations can be found on the MatlabBGL official website, here is a directory:
MatlabBGL
Popularity: 1% [?]
Translator
Follow Us
Video Posts
