Suurballe's algorithm

短语

释义与例句

name
  1. 1.

    An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.

    计算机 工程 数学

词源

Devised by John W. Suurballe and published in 1974.

来源：wiktionary