Package cdc.graphs.impl

Class InvertedGraph<N,E>

java.lang.Object

cdc.graphs.impl.GraphFilter<N,E>

cdc.graphs.impl.InvertedGraph<N,E>

Type Parameters:

N - Node class

E - Edge class

All Implemented Interfaces:

GraphAdapter<N,E>

public class InvertedGraph<N,E>
extends GraphFilter<N,E>

Create an inverted view of a Graph. Nodes are the same, edges are the same, except that their direction is inverted.

Author:

Damien Carbonne

Field Summary

Fields inherited from class cdc.graphs.impl.GraphFilter

delegate

Constructor Summary

Constructors

Constructor	Description
InvertedGraph(GraphAdapter<N,E> delegate)

Method Summary

Modifier and Type	Method	Description
boolean	containsEdge(E edge)
boolean	containsNode(N node)
Iterable<? extends E>	getEdges()
Iterable<? extends E>	getEdges(N node, EdgeDirection direction)
Iterable<? extends N>	getNodes()
N	getTip(E edge, EdgeTip tip)

Methods inherited from class cdc.graphs.impl.GraphFilter

checkEdgeValidity, checkNodeValidity, getDelegate

Methods inherited from class java.lang.Object

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

Methods inherited from interface cdc.graphs.GraphAdapter

getConnectedNodes, getConnectedNodes, getConnectivity, getEdges, getEdges, getEdges, getEdges, getEdgesCount, getEdgesCount, getEdgesCount, getEdgesStream, getEdgesStream, getEdgesStream, getLeaves, getNodes, getNodesCount, getNodesStream, getRoots, hasEdge, hasEdges, hasEdges, hasEdges, hasNodes, isLeaf, isRoot

Constructor Detail

InvertedGraph

public InvertedGraph(GraphAdapter<N,E> delegate)

Method Detail

getNodes

public final Iterable<? extends N> getNodes()

containsNode

public final boolean containsNode(N node)

getEdges

public final Iterable<? extends E> getEdges()

containsEdge

public final boolean containsEdge(E edge)

getEdges

public final Iterable<? extends E> getEdges(N node,
                                            EdgeDirection direction)

getTip

public final N getTip(E edge,
                      EdgeTip tip)