Uses of Interface Util.Graphs.Navigator

Overview

Package

Class

Use

Deprecated

Index

Home >> All >> Util >> [ Graphs overview ]

PREV NEXT

Uses of Interface
Util.Graphs.Navigator

Uses of Navigator in Util.Graphs

Classes in Util.Graphs that implement Navigator

class EdgeNavigator
This navigator is used as a wrapper for another navigator.

Fields in Util.Graphs declared as Navigator

protected Navigator EdgeNavigator.navigator

private static Navigator SCComponent.nav

Methods in Util.Graphs that return Navigator

Navigator Graph.getNavigator()


Navigator EdgeGraph.getNavigator()


Navigator SCCTopSortedGraph.getNavigator()

Methods in Util.Graphs with parameters of type Navigator

static void Traversals.test(Navigator nav, java.util.Collection roots)


static void Traversals.test_helper1(Navigator nav, java.lang.Object o, java.util.Set m)


static void Traversals.test_helper2(Navigator nav, java.lang.Object o, java.util.Set m)


static java.util.Set Traversals.getAllEdges(Navigator nav, java.util.Collection roots)


private static void Traversals.getAllEdges_helper(Navigator nav, java.lang.Object o, java.util.HashSet visitedNodes, java.util.HashSet visitedEdges)


static java.util.Map Traversals.buildPredecessorMap(Navigator nav, java.util.Collection roots)


static void Traversals.buildPredecessorMap_helper(Navigator nav, java.lang.Object o, java.util.Map m)


static java.util.Map Traversals.buildSuccessorMap(Navigator nav, java.util.Collection roots)


static void Traversals.buildSuccessorMap_helper(Navigator nav, java.lang.Object o, java.util.HashSet s, java.util.Map m)


static java.util.List Traversals.preOrder(Navigator nav, java.lang.Object root)


static java.util.List Traversals.preOrder(Navigator nav, java.util.Collection roots)


static java.util.List Traversals.reversePreOrder(Navigator nav, java.lang.Object root)


static java.util.List Traversals.reversePreOrder(Navigator nav, java.util.Collection roots)


static java.util.List Traversals.inOrder(Navigator nav, java.lang.Object root)


static java.util.List Traversals.inOrder(Navigator nav, java.util.Collection roots)


static java.util.List Traversals.reverseInOrder(Navigator nav, java.lang.Object root)


static java.util.List Traversals.reverseInOrder(Navigator nav, java.util.Collection roots)


static java.util.List Traversals.postOrder(Navigator nav, java.lang.Object root)


static java.util.List Traversals.postOrder(Navigator nav, java.util.Collection roots)


static java.util.List Traversals.reversePostOrder(Navigator nav, java.lang.Object root)


static java.util.List Traversals.reversePostOrder(Navigator nav, java.util.Collection roots)


private static java.util.List Traversals.traversal_helper(Navigator nav, java.util.Collection roots, byte type)


private static void Traversals.traversal_helper(Navigator nav, java.lang.Object node, java.util.HashSet visited, java.util.LinkedList result, byte type)
          Helper function to compute reverse post order.

static long CountPaths.countPaths(Navigator nav, java.util.Collection roots)


static long CountPaths.countPaths(Navigator nav, java.util.Collection roots, int k)


static SCComponent SCComponent.buildSCC(java.lang.Object root, Navigator navigator)
          Convenient version for the single root case (see the other buildSCC for details).

static java.util.Set SCComponent.buildSCC(java.util.Collection roots, Navigator navigator)
          Constructs the strongly connected components of the graph containing all the nodes reachable on paths that originate in nodes from roots.

private static void SCComponent.put_the_edges(Navigator navigator)


java.util.Set SCComponent.getEntrypoints(Navigator nav)


java.util.Set SCComponent.getExitpoints(Navigator nav)


java.util.Set SCComponent.getExitEdges(Navigator nav)

Constructors in Util.Graphs with parameters of type Navigator

EdgeNavigator(Navigator n)
Construct a new EdgeNavigator for the given navigator.