PHP Floyd Warshall algorithm

In computer science, the Floyd?Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weighted, directed graph.
A single execution of the algorithm will find the shortest path between all pairs of vertices.

One way to use Floyd Warshall algorithm is to calculate distances between different concepts from abitrary text ( for example user input, in some e-learning software ). You can quite easily construct weighted graph from text with painaa (Pathfinder analysis of inferential aggregated associations) algorithm, which you can use when calculating distances.

(5 comments)

Get some warm and cozy feeling inside and donate ;-). It helps to keep this website running.