net.walend.digraph
Interface IndexedMutableCEDigraph

All Superinterfaces:
CEDigraph, Digraph, HasState, IndexedCEDigraph, IndexedDigraph, MutableCEDigraph
All Known Implementing Classes:
MutableLMCEDigraph, MutableMatrixCEDigraph

public interface IndexedMutableCEDigraph
extends MutableCEDigraph, IndexedCEDigraph

Indexed mutators

Author:
David Walend dfw1@cornell.edu

Field Summary
 
Fields inherited from interface net.walend.digraph.CEDigraph
EMPTY
 
Method Summary
 java.lang.Object addEdge(int fromIndex, int toIndex, java.lang.Object edge)
           
 void insureCapacity(int capacity)
           
 java.lang.Object removeEdge(int fromIndex, int toIndex)
           
 Bag removeNode(int index)
           
 java.lang.Object setNode(int index, java.lang.Object node)
           
 
Methods inherited from interface net.walend.digraph.MutableCEDigraph
addEdge, addNode, addNodes, clear, clearEdges, removeCEDigraph, removeEdge, removeNode, removeNodes, retainNodes
 
Methods inherited from interface net.walend.digraph.CEDigraph
containsCEDigraph, containsEdge, edgeIterator, getEdge, getEdges, getInboundEdges, getOutboundEdges, intersectWithCEDigraph, sameCEDigraphAs, unionCEDigraph
 
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.IndexedCEDigraph
containsEdge, getEdge, getInboundEdges, getOutboundEdges, indexedEdgeIterator
 
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 java.lang.Object addEdge(int fromIndex,
                                int toIndex,
                                java.lang.Object edge)
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 Bag 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 java.lang.Object 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.


Copyright (c) 2001, 2002, David Walend