image thumbnail

updated 2 years ago

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;

image thumbnail

updated 3 years ago

RPG Lab by Derek O'Connor

A set of functions for generating and testing random permutations of the integers (1,2, ..., n). (random permutation ge..., derangements, cyclic permutations)

Contact us