Two algorithms for shortest-paths problems in edge-weighted directed graphs (Q7238537)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8196408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for shortest-paths problems in edge-weighted directed graphs |
scientific article; zbMATH DE number 8196408 |
Statements
Two algorithms for shortest-paths problems in edge-weighted directed graphs (English)
0 references
8 May 2026
0 references
single-source shortest paths problem (SSSP)
0 references
edge-weighted directed graph
0 references
all-pairs shortest paths problem (APSP)
0 references
directed acyclic graph (DAG)
0 references
time complexity
0 references
0 references
0 references
