net.walend.digraph
Interface IndexedMutableGEDigraph

All Superinterfaces:

Digraph, GEDigraph, HasState, IndexedDigraph, IndexedGEDigraph, MutableGEDigraph

All Known Implementing Classes:

MutableLMGEDigraph, MutableMatrixGEDigraph

public interface IndexedMutableGEDigraph

extends MutableGEDigraph, IndexedGEDigraph

Indexed mutators

Author:

David Walend dfw1@cornell.edu

Field Summary

Fields inherited from interface net.walend.digraph.GEDigraph

EMPTY

Method Summary

boolean	addEdge(int fromIndex, int toIndex)
void	insureCapacity(int capacity)
boolean	removeEdge(int fromIndex, int toIndex)
int	removeNode(int index)
java.lang.Object	setNode(int index, java.lang.Object node)

Methods inherited from interface net.walend.digraph.MutableGEDigraph

addEdge, addNode, addNodes, clear, clearEdges, removeEdge, removeGEDigraph, removeNode, removeNodes, retainNodes

Methods inherited from interface net.walend.digraph.GEDigraph

containsGEDigraph, intersectWithGEDigraph, sameGEDigraphAs, unionGEDigraph

Methods inherited from interface net.walend.digraph.Digraph

containsEdge, containsNode, containsNodes, countInboundEdges, countOutboundEdges, edgeCount, edgeNodeIterator, getFromNodes, getNodes, getToNodes, isEdgeFree, isEmpty, nodeCount, nodeIterator

Methods inherited from interface net.walend.collection.HasState

getPrincipleInterface, sameStateAs

Methods inherited from interface net.walend.digraph.IndexedDigraph

containsEdge, containsNode, countInboundEdges, countOutboundEdges, getFromIndices, getFromNodes, getNode, getNodeIndex, getToIndices, getToNodes, indexedEdgeNodeIterator, indexedNodeIterator, nodeCapacity, nodeIndices

Method Detail

insureCapacity

public void insureCapacity(int capacity)

setNode

public java.lang.Object setNode(int index,
                                java.lang.Object node)

Throws:

java.lang.ArrayIndexOutOfBoundsException - if index does not have a node. Use nodeIndicies() or getNodeIndex() to avoid these. In your code, catch ArrayIndexOutOfBoundsException and throw a ConcurrentModificationException if you think that's the problem.

addEdge

public boolean addEdge(int fromIndex,
                       int toIndex)

Throws:

java.lang.ArrayIndexOutOfBoundsException - if index does not have a node. Use nodeIndicies() or getNodeIndex() to avoid these. In your code, catch ArrayIndexOutOfBoundsException and throw a ConcurrentModificationException if you think that's the problem.

removeNode

public int removeNode(int index)

Throws:

java.lang.ArrayIndexOutOfBoundsException - if index does not have a node. Use nodeIndicies() or getNodeIndex() to avoid these. In your code, catch ArrayIndexOutOfBoundsException and throw a ConcurrentModificationException if you think that's the problem.

removeEdge

public boolean removeEdge(int fromIndex,
                          int toIndex)

Throws:

java.lang.ArrayIndexOutOfBoundsException - if index does not have a node. Use nodeIndicies() or getNodeIndex() to avoid these. In your code, catch ArrayIndexOutOfBoundsException and throw a ConcurrentModificationException if you think that's the problem.