An algorithm to find all paths between two nodes in a graph (Q916679)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to find all paths between two nodes in a graph |
scientific article; zbMATH DE number 4154482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to find all paths between two nodes in a graph |
scientific article; zbMATH DE number 4154482 |
Statements
An algorithm to find all paths between two nodes in a graph (English)
0 references
1990
0 references
In this note the authors present an algorithm for finding all the paths between two nodes in a graph. The algorithm is a well-known application of the depth-first search strategy and the authors report on some simulations they performed (on aqueous systems) using several kinds of computer systems.
0 references
algorithm
0 references
finding all the paths between two nodes in a graph
0 references
simulations
0 references
0.7256354689598083
0 references
0.722893476486206
0 references
0.7175878882408142
0 references
0.7135900259017944
0 references
