Paths and Cycles
- Path (graph theory)
- Seven Bridges of Königsberg
- Eulerian path
- Three-cottage problem
- Shortest path problem
- Dijkstra's algorithm
- Open shortest path first
- Dijkstra's algorithm
- Flooding algorithm
- Route inspection problem
- Hamiltonian path
- Hamiltonian path problem
- Knight's tour
- Traveling salesman problem
- Nearest neighbour algorithm
- Bottleneck traveling salesman problem
- Path analysis
Read more about this topic: List Of Graph Theory Topics
Famous quotes containing the words paths and/or cycles:
“Now the hungry lion roars,
And the wolf behowls the moon;
Whilst the heavy ploughman snores,
All with weary task fordone.
Now the wasted brands do glow,
Whilst the screech-owl, screeching loud,
Puts the wretch that lies in woe
In remembrance of a shroud.
Now it is the time of night,
That the graves, all gaping wide,
Every one lets forth his sprite,
In the church-way paths to glide:”
—William Shakespeare (15641616)
“The stars which shone over Babylon and the stable in Bethlehem still shine as brightly over the Empire State Building and your front yard today. They perform their cycles with the same mathematical precision, and they will continue to affect each thing on earth, including man, as long as the earth exists.”
—Linda Goodman (b. 1929)