An algorithm for finding two disjointpaths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.
Origin
Devised by John W. Suurballe and published in 1974.
Modern English dictionary
Explore and search massive catalog of over 900,000 word meanings.
Word of the Day
Get a curated memorable word every day.
Challenge yourself
Level up your vocabulary by setting personal goals.