noun
Meaning 1
An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.
Definition source: English Wiktionary via Wiktextract
Topics: computing, engineering, graph-theory, mathematics, natural-sciences, physical-sciences, sciences
No example sentence was provided for this meaning.
Meaning relationships
Synonyms: none provided
Antonyms: none provided