(Q1058754)

English

shortest path problem

problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized

single-pair shortest path problem

In more languages

default for all languages

No label defined

No description defined

edit

Statements

instance of

computational problem

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

Identifiers

GND ID

4138403-9

1 reference

stated in

Integrated Authority File

Dictionary of Algorithms and Data Structures ID

singlepairShortestpathProblem

0 references

shortestpath

0 references

Encyclopædia Britannica Online ID

topic/shortest-path-problem

subject named as

shortest-path problem

0 references

1 reference

28 October 2013

0 references

Microsoft Academic ID

0 references

1 reference

26 January 2022

https://docs.openalex.org/download-snapshot/snapshot-data-format

archive URL

https://web.archive.org/web/20220125070108/https://docs.openalex.org/download-snapshot/snapshot-data-format

archive date

25 January 2022

(Q1058754)

shortest path problem

Statements

Identifiers

Sitelinks

Wikipedia(23 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)