The Bellman-Ford-Moore Shortest Path Algorithm by Derek O'Connor

A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm (shortest paths, sparse graphs)

BFMSpathOT(G,r)

Initialize(G)

TestBFMOTMaps;

MatlabBGL by David Gleich

MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures. (bfs, dfs, dijkstra)

A=erdos_reyni(n,p)

[d pred f]=astar_search(A,s,h,varargin)

[is_planar ksubgraph EI]=boyer_myrvold_planarity_test(A,var...