net.walend.digraph
Class MutableHashUEDigraph

java.lang.Object
  |
  +--net.walend.digraph.AbstractHashUEDigraph
        |
        +--net.walend.digraph.MutableHashUEDigraph

All Implemented Interfaces:

HasState, MutableUEDigraph, UEDigraph

public class MutableHashUEDigraph

extends AbstractHashUEDigraph

implements MutableUEDigraph

Author:

David Walend

Nested Class Summary

Nested classes inherited from class net.walend.digraph.AbstractHashUEDigraph

AbstractHashUEDigraph.HashEdgeIterator, AbstractHashUEDigraph.IteratorWrapper, AbstractHashUEDigraph.NodePair

Field Summary

private static int

DEFAULTSIZE

Fields inherited from class net.walend.digraph.AbstractHashUEDigraph

Fields inherited from interface net.walend.digraph.UEDigraph

EMPTY

Constructor Summary

MutableHashUEDigraph()

MutableHashUEDigraph(int nodeCapacity, int edgeCapacity)

MutableHashUEDigraph(UEDigraph digraph)

Method Summary

java.lang.Object	addEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge) Return null if fromNode or toNode are not in this UEDigraph, or if no existing edge is displaced by edge.
boolean	addNode(java.lang.Object node) Return true if the node is added successfully, false if the digraph does not change.
boolean	addNodes(Set nodes) Return true if adding the nodes changes the digraph.
void	clear() Remove all nodes and edges from the UEDigraph
void	clearEdges() Remove all the edges from the UEDigraph.
boolean	removeEdge(java.lang.Object edge) Return true if this edge existed in the digraph, false if this operation doesn't change the digraph at all.
java.lang.Object	removeEdge(java.lang.Object fromNode, java.lang.Object toNode) Return the edge that connected fromNode to toNode, or null if no edge existed.
boolean	removeEdges(Set edges) Return true if any edges were removed from the digraph.
Set	removeNode(java.lang.Object node) Return the Set of orphaned edges that are removed with node
Set	removeNodes(Set nodes) Return the Set of edges orphaned edges when these nodes are removed.
Set	removeUEDigraph(UEDigraph digraph) Return a Set of edges orphaned when digraph is removed
boolean	retainEdges(Set edges) Return true if this UEDigraph chages at all, false if not.
Set	retainNodes(Set nodes) Return a Set of orphaned edges when the nodes are removed.

Methods inherited from class net.walend.digraph.AbstractHashUEDigraph

containsEdge, containsEdge, containsEdge, containsEdges, containsNode, containsNodes, containsUEDigraph, countInboundEdges, countOutboundEdges, edgeCount, edgeIterator, getEdge, getEdges, getFromNode, getFromNodes, getInboundEdges, getNodes, getOutboundEdges, getPrincipleInterface, getToNode, getToNodes, intersectWithUEDigraph, isEdgeFree, isEmpty, nodeCount, nodeIterator, sameStateAs, sameUEDigraphAs, toString, unionUEDigraph

Methods inherited from class java.lang.Object

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

Methods inherited from interface net.walend.digraph.UEDigraph

containsEdge, containsEdge, containsEdge, containsEdges, containsNode, containsNodes, containsUEDigraph, countInboundEdges, countOutboundEdges, edgeCount, edgeIterator, getEdge, getEdges, getFromNode, getFromNodes, getInboundEdges, getNodes, getOutboundEdges, getToNode, getToNodes, intersectWithUEDigraph, isEdgeFree, isEmpty, nodeCount, nodeIterator, sameUEDigraphAs, unionUEDigraph

Methods inherited from interface net.walend.collection.HasState

getPrincipleInterface, sameStateAs

Field Detail

DEFAULTSIZE

private static final int DEFAULTSIZE

Constructor Detail

MutableHashUEDigraph

public MutableHashUEDigraph()

MutableHashUEDigraph

public MutableHashUEDigraph(int nodeCapacity,
                            int edgeCapacity)

MutableHashUEDigraph

public MutableHashUEDigraph(UEDigraph digraph)

Method Detail

addNode

public boolean addNode(java.lang.Object node)

Description copied from interface: MutableUEDigraph

Return true if the node is added successfully, false if the digraph does not change.

Specified by:

addNode in interface MutableUEDigraph

Overrides:

addNode in class AbstractHashUEDigraph

addEdge

public java.lang.Object addEdge(java.lang.Object fromNode,
                                java.lang.Object toNode,
                                java.lang.Object edge)
                         throws NodeMissingException,
                                EdgeNotUniqueException

Description copied from interface: MutableUEDigraph

Return null if fromNode or toNode are not in this UEDigraph, or if no existing edge is displaced by edge. Otherwise, return the edge that is displaced.

Specified by:

addEdge in interface MutableUEDigraph

Overrides:

addEdge in class AbstractHashUEDigraph

removeNode

public Set removeNode(java.lang.Object node)
               throws NodeMissingException

Description copied from interface: MutableUEDigraph

Return the Set of orphaned edges that are removed with node

Specified by:

removeNode in interface MutableUEDigraph

Overrides:

removeNode in class AbstractHashUEDigraph

removeEdge

public boolean removeEdge(java.lang.Object edge)

Description copied from interface: MutableUEDigraph

Return true if this edge existed in the digraph, false if this operation doesn't change the digraph at all.

Specified by:

removeEdge in interface MutableUEDigraph

Overrides:

removeEdge in class AbstractHashUEDigraph

removeEdge

public java.lang.Object removeEdge(java.lang.Object fromNode,
                                   java.lang.Object toNode)
                            throws NodeMissingException

Description copied from interface: MutableUEDigraph

Return the edge that connected fromNode to toNode, or null if no edge existed.

Specified by:

removeEdge in interface MutableUEDigraph

Overrides:

removeEdge in class AbstractHashUEDigraph

addNodes

public boolean addNodes(Set nodes)

Description copied from interface: MutableUEDigraph

Return true if adding the nodes changes the digraph.

Specified by:

addNodes in interface MutableUEDigraph

Overrides:

addNodes in class AbstractHashUEDigraph

removeNodes

public Set removeNodes(Set nodes)

Description copied from interface: MutableUEDigraph

Return the Set of edges orphaned edges when these nodes are removed.

Specified by:

removeNodes in interface MutableUEDigraph

Overrides:

removeNodes in class AbstractHashUEDigraph

removeEdges

public boolean removeEdges(Set edges)

Description copied from interface: MutableUEDigraph

Return true if any edges were removed from the digraph. False if not.

Specified by:

removeEdges in interface MutableUEDigraph

Overrides:

removeEdges in class AbstractHashUEDigraph

removeUEDigraph

public Set removeUEDigraph(UEDigraph digraph)

Description copied from interface: MutableUEDigraph

Return a Set of edges orphaned when digraph is removed

Specified by:

removeUEDigraph in interface MutableUEDigraph

Overrides:

removeUEDigraph in class AbstractHashUEDigraph

retainNodes

public Set retainNodes(Set nodes)

Description copied from interface: MutableUEDigraph

Return a Set of orphaned edges when the nodes are removed.

Specified by:

retainNodes in interface MutableUEDigraph

Overrides:

retainNodes in class AbstractHashUEDigraph

retainEdges

public boolean retainEdges(Set edges)

Description copied from interface: MutableUEDigraph

Return true if this UEDigraph chages at all, false if not.

Specified by:

retainEdges in interface MutableUEDigraph

Overrides:

retainEdges in class AbstractHashUEDigraph

clear

public void clear()

Description copied from interface: MutableUEDigraph

Remove all nodes and edges from the UEDigraph

Specified by:

clear in interface MutableUEDigraph

Overrides:

clear in class AbstractHashUEDigraph

clearEdges

public void clearEdges()

Description copied from interface: MutableUEDigraph

Remove all the edges from the UEDigraph.

Specified by:

clearEdges in interface MutableUEDigraph

Overrides:

clearEdges in class AbstractHashUEDigraph