Johnson's algorithm

短语

释义与例句

name
  1. 1.

    An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.

    数学

词源

Published in 1977 by Donald B. Johnson.

来源：wiktionary