Shortest Path ReductionSolution

G: weighted graph

1. Equivalence classes based

on 0-cycles.

2. Graph based on

representatives.

Safe to remove redundant edges

3. Shortest Path Reduction

=

One cycle pr. class

+

Removal of redundant edges

between classes

Previous slide

Next slide

Back to first slide

View graphic version