Package io.github.oliviercailloux.j_voting.graph

Class ForwardingGraph<N>

java.lang.Object

com.google.common.graph.AbstractGraph<N>

io.github.oliviercailloux.j_voting.graph.ForwardingGraph<N>

All Implemented Interfaces:

Graph<N>, PredecessorsFunction<N>, SuccessorsFunction<N>

Direct Known Subclasses:

GraphView

public abstract class ForwardingGraph<N>
extends AbstractGraph<N>

A class to allow Graph implementations to be backed by a BaseGraph. This class is a copy of a Guava class which is not currently planned to be released as a general-purpose forwarding class.

Author:

James Sexton

Constructor Summary

Constructors

Constructor	Description
ForwardingGraph()

Method Summary

Modifier and Type	Method	Description
Set<N>	adjacentNodes(N node)
boolean	allowsSelfLoops()
int	degree(N node)
protected abstract Graph<N>	delegate()
protected long	edgeCount()	Defer to AbstractGraph.edges() (based on successors(Object)) for full edges() implementation.
Set<EndpointPair<N>>	edges()
boolean	hasEdgeConnecting(EndpointPair<N> endpoints)
boolean	hasEdgeConnecting(N nodeU, N nodeV)
ElementOrder<N>	incidentEdgeOrder()
Set<EndpointPair<N>>	incidentEdges(N arg0)
int	inDegree(N node)
boolean	isDirected()
protected boolean	isOrderingCompatible(EndpointPair<?> arg0)
ElementOrder<N>	nodeOrder()
Set<N>	nodes()
int	outDegree(N node)
Set<N>	predecessors(N node)
Set<N>	successors(N node)
protected void	validateEndpoints(EndpointPair<?> arg0)

Methods inherited from class com.google.common.graph.AbstractGraph

equals, hashCode, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.google.common.graph.Graph

edges, incidentEdgeOrder, incidentEdges

Constructor Detail

ForwardingGraph

public ForwardingGraph()

Method Detail

delegate

protected abstract Graph<N> delegate()

nodes

public Set<N> nodes()

edgeCount

protected long edgeCount()

Defer to AbstractGraph.edges() (based on successors(Object)) for full edges() implementation.

isDirected

public boolean isDirected()

allowsSelfLoops

public boolean allowsSelfLoops()

nodeOrder

public ElementOrder<N> nodeOrder()

adjacentNodes

public Set<N> adjacentNodes(N node)

predecessors

public Set<N> predecessors(N node)

successors

public Set<N> successors(N node)

degree

public int degree(N node)

Specified by:

degree in interface Graph<N>

inDegree

public int inDegree(N node)

Specified by:

inDegree in interface Graph<N>

outDegree

public int outDegree(N node)

Specified by:

outDegree in interface Graph<N>

hasEdgeConnecting

public boolean hasEdgeConnecting(N nodeU,
                                 N nodeV)

Specified by:

hasEdgeConnecting in interface Graph<N>

hasEdgeConnecting

public boolean hasEdgeConnecting(EndpointPair<N> endpoints)

Specified by:

hasEdgeConnecting in interface Graph<N>

edges

public Set<EndpointPair<N>> edges()

incidentEdgeOrder

public ElementOrder<N> incidentEdgeOrder()

incidentEdges

public Set<EndpointPair<N>> incidentEdges(N arg0)

validateEndpoints

protected final void validateEndpoints(EndpointPair<?> arg0)

isOrderingCompatible

protected final boolean isOrderingCompatible(EndpointPair<?> arg0)