

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
public interface UndirectedMutableLongGraph
An extension of an UndirectedLongGraph
.
The graph can be changed after
it was created.
Nested Class Summary  

static interface 
UndirectedMutableLongGraph.Edge
Deprecated. The extension of UndirectedLongGraph.Edge to be mutable. 
Field Summary 

Fields inherited from interface de.aitools.aq.graph.weighted.UndirectedLongGraph 

DEFAULT_UNCONNECTED_WEIGHT 
Method Summary  

boolean 
addVertex(long vertex)
Deprecated. Add a vertex to the graph. 
java.util.Iterator<? extends UndirectedMutableLongGraph.Edge> 
edges()
Deprecated. Get an iterator over all edges of the graph. 
java.util.Iterator<? extends UndirectedMutableLongGraph.Edge> 
edgesConnectedTo(long vertex)
Deprecated. Get an iterator over all edges in the graph, given vertex is connected with. 
UndirectedMutableLongGraph.Edge 
getEdge(long vertexA,
long vertexB)
Deprecated. Get the UndirectedLongGraph.Edge connecting the two vertices. 
double 
removeEdge(long vertexA,
long vertexB)
Deprecated. Remove a edge determined by two vertices. 
boolean 
removeVertex(long vertex)
Deprecated. Remove a vertex from the graph. 
double 
setEdgeWeight(long vertexA,
long vertexB,
double weight)
Deprecated. Set the weight of a edge determined by two vertices. 
void 
setUnconnectedWeight(double unconnectedWeight)
Deprecated. Change the weight that is returned by UndirectedLongGraph.getEdgeWeight(long, long) if the two vertices are not
connected. 
Methods inherited from interface de.aitools.aq.graph.weighted.UndirectedLongGraph 

containsEdge, containsVertex, getEdgeWeight, getUnconnectedWeight, numEdges, numEdges, numVertices, vertices, verticesConnectedTo 
Method Detail 

void setUnconnectedWeight(double unconnectedWeight)
UndirectedLongGraph.getEdgeWeight(long, long)
if the two vertices are not
connected. This will remove all edges that currently have
unconnectedWeight as their weight.
unconnectedWeight
 The new weight for unconnected vertices.java.util.Iterator<? extends UndirectedMutableLongGraph.Edge> edges()
UndirectedLongGraph
edges
in interface UndirectedLongGraph
UndirectedLongGraph.numEdges()
java.util.Iterator<? extends UndirectedMutableLongGraph.Edge> edgesConnectedTo(long vertex)
UndirectedLongGraph
edgesConnectedTo
in interface UndirectedLongGraph
vertex
 The vertex.
UndirectedLongGraph.numEdges(long)
UndirectedMutableLongGraph.Edge getEdge(long vertexA, long vertexB)
UndirectedLongGraph
UndirectedLongGraph.Edge
connecting the two vertices. The object will also
be returned if there does not exists such an edge in the graph. Use
UndirectedLongGraph.Edge.exists()
to check.
getEdge
in interface UndirectedLongGraph
vertexA
 One vertex.vertexB
 The other vertex.
UndirectedLongGraph.containsEdge(long, long)
,
UndirectedLongGraph.getEdgeWeight(long, long)
boolean addVertex(long vertex)
vertex
 The vertex to be added.
boolean removeVertex(long vertex)
vertex
 The vertex to be removed.
double setEdgeWeight(long vertexA, long vertexB, double weight)
UndirectedLongGraph.getUnconnectedWeight()
, this should be the same as calling
removeEdge(long, long)
. The old weight of the edge is
returned, which may be UndirectedLongGraph.getUnconnectedWeight()
if the edge had
not existed.
vertexA
 One vertex of the edge.vertexB
 The other vertex of the edge.weight
 The new weight of the edge.
UndirectedLongGraph.getEdgeWeight(long, long)
directly before this call.
java.util.NoSuchElementException
 If at least one of the two vertices is
not a part of the graph (see UndirectedLongGraph.containsVertex(long)
).double removeEdge(long vertexA, long vertexB)
UndirectedLongGraph.getUnconnectedWeight()
if the edge had
not existed (in which case nothing has happened).
vertexA
 One vertex of the edge.vertexB
 The other vertex of the edge.
UndirectedLongGraph.getEdgeWeight(long, long)
directly before this call.
java.util.NoSuchElementException
 If at least one of the two vertices is
not a part of the graph (see UndirectedLongGraph.containsVertex(long)
).


PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 