Package io.github.oliviercailloux.j_voting.graph

Class ForwardingMutableGraph<N>

java.lang.Object

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

All Implemented Interfaces:

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

public class ForwardingMutableGraph<N>
extends Object
implements MutableGraph<N>

Constructor Summary

Constructors

Modifier	Constructor	Description
protected	ForwardingMutableGraph(MutableGraph<N> delegate)

Method Summary

Modifier and Type	Method	Description
boolean	addNode(N node)
Set<N>	adjacentNodes(N node)
boolean	allowsSelfLoops()
int	degree(N node)
Set<EndpointPair<N>>	edges()
boolean	equals(Object o2)
boolean	hasEdgeConnecting(EndpointPair<N> endpoints)
boolean	hasEdgeConnecting(N nodeU, N nodeV)
int	hashCode()
ElementOrder<N>	incidentEdgeOrder()
Set<EndpointPair<N>>	incidentEdges(N node)
int	inDegree(N node)
boolean	isDirected()
ElementOrder<N>	nodeOrder()
Set<N>	nodes()
int	outDegree(N node)
Set<N>	predecessors(N node)
boolean	putEdge(EndpointPair<N> endpoints)
boolean	putEdge(N nodeU, N nodeV)
boolean	removeEdge(EndpointPair<N> endpoints)
boolean	removeEdge(N nodeU, N nodeV)
boolean	removeNode(N node)
Set<N>	successors(N node)

Methods inherited from class java.lang.Object

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

Constructor Detail

ForwardingMutableGraph

protected ForwardingMutableGraph(MutableGraph<N> delegate)

Method Detail

nodes

public Set<N> nodes()

Specified by:

nodes in interface Graph<N>

edges

public Set<EndpointPair<N>> edges()

Specified by:

edges in interface Graph<N>

isDirected

public boolean isDirected()

Specified by:

isDirected in interface Graph<N>

allowsSelfLoops

public boolean allowsSelfLoops()

Specified by:

allowsSelfLoops in interface Graph<N>

nodeOrder

public ElementOrder<N> nodeOrder()

Specified by:

nodeOrder in interface Graph<N>

adjacentNodes

public Set<N> adjacentNodes(N node)

Specified by:

adjacentNodes in interface Graph<N>

predecessors

public Set<N> predecessors(N node)

Specified by:

predecessors in interface Graph<N>

Specified by:

predecessors in interface PredecessorsFunction<N>

successors

public Set<N> successors(N node)

Specified by:

successors in interface Graph<N>

Specified by:

successors in interface SuccessorsFunction<N>

incidentEdges

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

Specified by:

incidentEdges in interface Graph<N>

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>

addNode

public boolean addNode(N node)

Specified by:

addNode in interface MutableGraph<N>

putEdge

public boolean putEdge(N nodeU,
                       N nodeV)

Specified by:

putEdge in interface MutableGraph<N>

removeNode

public boolean removeNode(N node)

Specified by:

removeNode in interface MutableGraph<N>

removeEdge

public boolean removeEdge(N nodeU,
                          N nodeV)

Specified by:

removeEdge in interface MutableGraph<N>

hasEdgeConnecting

public boolean hasEdgeConnecting(EndpointPair<N> endpoints)

Specified by:

hasEdgeConnecting in interface Graph<N>

putEdge

public boolean putEdge(EndpointPair<N> endpoints)

Specified by:

putEdge in interface MutableGraph<N>

removeEdge

public boolean removeEdge(EndpointPair<N> endpoints)

Specified by:

removeEdge in interface MutableGraph<N>

incidentEdgeOrder

public ElementOrder<N> incidentEdgeOrder()

Specified by:

incidentEdgeOrder in interface Graph<N>

equals

public boolean equals(Object o2)

Specified by:

equals in interface Graph<N>

Overrides:

equals in class Object

hashCode

public int hashCode()

Specified by:

hashCode in interface Graph<N>

Overrides:

hashCode in class Object