ConceptTheory & Algos
Longest path reduction via negative weights
Converting a longest path problem into a shortest path problem by inverting edge weights to negative values.
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.