chord.util.graph
Class BackEdgesFinder<Node>

java.lang.Object
  chord.util.graph.BackEdgesFinder<Node>

public class BackEdgesFinder<Node>
extends java.lang.Object

Algorithm for finding all back edges in a directed graph.

Author:

Mayur Naik (mhn@cs.stanford.edu)

Method Summary

static <Node> java.util.Set<Pair<Node,Node>>

build(IGraph<Node> graph) Provides all back edges in a depth-first traversal of a given directed graph reachable from its root nodes.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

build

public static <Node> java.util.Set<Pair<Node,Node>> build(IGraph<Node> graph)

Provides all back edges in a depth-first traversal of a given directed graph reachable from its root nodes.

Parameters:

graph - A directed graph.

Returns:

All back edges in a depth-first traversal of the given directed graph reachable from its root nodes.