A Solution to a Stable Paths Problem
- node u’s assigned path is either the null path or is a path uwP, where wP is assigned to node w and {u,w} is an edge in the graph,
- each node is assigned the highest ranked path among those consistent with the paths assigned to its neighbors.
A Solution need not represent
A solution is an assignment of
permitted paths to each node