Cycle
One word, taught differently in 2 fields. Each use is given apart.
In Theory & Algos
A closed walk of length at least three where all intermediate vertices are different.
In Mathematics
A path of edges that starts and ends at the same node.
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
1In Mathematics
1Lectures that assume it
14The first 12 are shown.
- Deterministic State Laws & Conservation of Information
- Depth-First Search (DFS), Topological Sort
- Incremental Improvement: Max Flow, Min Cut
- A New Perspective on Dirac-Type Results in Hypergraphs
- Nodal surplus and the spectral decomposition of the cycle space
- Bayes' Nets: Inference (Variable Elimination)
- Graph Theory III
- Feigenbaum's Renormalization Analysis of Period Doubling
- Approximation Algorithms: Traveling Salesman Problem
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
- Treewidth Definitions
- Depth-First Search (DFS) (MIT 6.006, Recitation 14)
Connections
24The lectures that define it or assume it, and the concepts next to it.
Concepts8
Show 2 moreShow fewer
Lectures16
- Graph Theory II: Minimum Spanning Trees
- Completing a Rank-One Matrix and Circulants
- Deterministic State Laws & Conservation of Information
- Depth-First Search (DFS), Topological Sort
- Incremental Improvement: Max Flow, Min Cut
- A New Perspective on Dirac-Type Results in Hypergraphs
Show 10 moreShow fewer
- Nodal surplus and the spectral decomposition of the cycle space
- Bayes' Nets: Inference (Variable Elimination)
- Graph Theory III
- Feigenbaum's Renormalization Analysis of Period Doubling
- Approximation Algorithms: Traveling Salesman Problem
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
- Treewidth Definitions
- Depth-First Search (DFS) (MIT 6.006, Recitation 14)
- Dynamic Programming: Crazy Eights and Shortest Path (MIT 6.006, Recitation 19)
- What Does String Topology Know About the Manifold It Lives On?