Path
One word, taught differently in 2 fields. Each use is given apart.
In Theory & Algos
The language consisting of directed graphs that contain a path between two specified nodes.
In Economics
A way of getting through the tree from the beginning to an end.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
In Theory & Algos
2Each in their own terms, from the easiest level.
Tom Leighton
A walk where all vertices are different.
In Economics
1Lectures that assume it
14The first 12 are shown.
- Breadth-First Search (BFS)
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Games, Generalized Geography
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- P and NP, SAT, Poly-Time Reducibility
- AVL Trees, Tree Rotations & Guaranteed O(log n) Height
- Bellman-Ford
- Graph Theory III
- Hierarchy Theorems
- Savitch's Theorem and NL
- Counting
- Approximation Algorithms: Traveling Salesman Problem
Connections
26The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures17
- Sequential Games: Moral Hazard, Incentives, and Hungry Lions
- Graph Theory II: Minimum Spanning Trees
- Time Complexity
- Breadth-First Search (BFS)
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Games, Generalized Geography
Show 11 moreShow fewer
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- P and NP, SAT, Poly-Time Reducibility
- AVL Trees, Tree Rotations & Guaranteed O(log n) Height
- Bellman-Ford
- Graph Theory III
- Hierarchy Theorems
- Savitch's Theorem and NL
- Counting
- Approximation Algorithms: Traveling Salesman Problem
- Single-Source Shortest Paths Problem
- Search: Depth-First, Hill Climbing, Beam Search