• Parse STN file to create STN object
• Floyd-Warshall (distance matrix)
• Bellman-Ford (with extra source S, or extra sink node S) Computes a distance vector which can be used to generate a solution.
• Dijkstra (with node already in the network as source ... or sink) Only works for non-neg edges. Computes a distance vector.
• Johnson's algorithm. Runs BF to generate a potential function h. Uses N rounds of Dijkstra to fill in N rows of distance matrix.
• Naive algorithm for updating distance matrix in response to a single new edge.
• Prop fwd/Prop bkwd alg for updating distance matrix ...
• Ramalingam99 alg. for updating the solution to a consistent network in response to a new edge.

Newer: Directed path consistency, dispatchability.