Moore's algorithm

E1713897 UNEXPLORED

Moore's algorithm is a graph-theoretic shortest-path algorithm that computes the minimum number of edges from a source to all other vertices in an unweighted graph, essentially equivalent to breadth-first search.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Moore's algorithm canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Edward F. Moore → notableWork → Moore's algorithm ⓘ