标题: (基本图论函数库)--函数相当丰富 [打印本页] 作者: 建不了的模。 时间: 2014-10-9 10:32 标题: (基本图论函数库)--函数相当丰富 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).
Planar Graphs: Boyer-Myrvold planarity testing, Chrobak-Payne straight line drawing
Graph Layout: force directed layout, spring based layout, topology filling layout
The package includes precompiled MEX files for Windows (32-bit and 64-bit), and Linux (32-bit and 64-bit for Matlab 2006b+), and MacOSX (32-bit Intel and 32-bit PPC).
Please contact me (see the website) if you have an issue with the software and I will help you try and resolve it. (If you need an old version, check my Stanford website for older codes.)
Precompiled for 64-bit Linux (Matlab R2006b+), 32-bit Linux (Matlab R14SP3+), 32-bit Windows (Matlab R2007a+), 32-bit Mac OS X PPC (Matlab 2007a+), 32-bit Mac OS X Intel (Matlab 2007a+). Compiled and tested on 64-bit Windows and Solaris and other versions of Matlab.
