1.Previous
3.Next

completed, and , and their incident edges, are removed. Eachremaining vertex stores a 2-dimensional label with values from to .Given two vertices and , and their labels and , we say that if and only if , , and there exists at least one component or which is strictlyless than or , respectively.

The main result of this method then states that is reachable from if andonly if , which is easily calculated in time.