ConceptTheory & Algos
Graph transformation for parity paths
Duplicating each node in a graph into an even-path and an odd-path version allows finding shortest paths with parity constraints using standard algorithms like Dijkstra.
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.
Graph representation1Shortest path1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.