Package cdc.graphs.impl

Class ImplicitSubGraph<N,E>

java.lang.Object

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

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

Type Parameters:

N - Node type.

E - Edge type.

All Implemented Interfaces:

GraphAdapter<N,E>

public abstract class ImplicitSubGraph<N,E>
extends GraphFilter<N,E>

Base implementation of implicit subgraph.

Concrete implementation must implement:

• containsNode.
• containsEdge if necessary. Default implementation accepts all edges that connect 2 accepted nodes.

Author:

Damien Carbonne

Field Summary

Fields inherited from class cdc.graphs.impl.GraphFilter

delegate

Constructor Summary

Constructors

Modifier	Constructor	Description
protected	ImplicitSubGraph(GraphAdapter<N,E> delegate)

Method Summary

Modifier and Type	Method	Description
boolean	containsEdge(E edge)
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

containsNode, 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 Details

ImplicitSubGraph

protected ImplicitSubGraph(GraphAdapter<N,E> delegate)

Method Details

getNodes

public Iterable<? extends N> getNodes()

getEdges

public Iterable<? extends E> getEdges()

containsEdge

public boolean containsEdge(E edge)

getEdges

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

getTip

public N getTip(E edge,
 EdgeTip tip)