public class UndirectedGraphImpl<V,E> extends java.lang.Object implements UndirectedGraph<V,E>
Constructor and Description |
---|
UndirectedGraphImpl() |
Modifier and Type | Method and Description |
---|---|
int |
addEdge(int v1,
int v2,
E obj) |
void |
addListener(UndirectedGraphListener l) |
int |
addVertex() |
java.util.List<gnu.trove.list.array.TIntArrayList> |
findAllPaths(int from,
java.util.function.Function<V,java.lang.Boolean> pathComplete,
java.util.function.Function<E,java.lang.Boolean> pathCanceled) |
int |
getEdgeCount() |
E |
getEdgeObject(int e) |
java.util.List<E> |
getEdgeObjects(int v1,
int v2) |
java.util.stream.Stream<E> |
getEdgeObjectStream() |
int[] |
getEdges() |
java.lang.Iterable<E> |
getEdgesObject() |
int |
getEdgeVertex1(int e) |
int |
getEdgeVertex2(int e) |
int |
getMaxVertex() |
int |
getVertexCount() |
V |
getVertexObject(int v) |
java.util.stream.Stream<V> |
getVertexObjectStream() |
int[] |
getVertices() |
java.lang.Iterable<V> |
getVerticesObj() |
void |
print(java.io.PrintStream out,
java.util.function.Function<V,java.lang.String> vertexToString,
java.util.function.Function<E,java.lang.String> edgeToString) |
void |
removeAllEdges() |
void |
removeAllVertices() |
E |
removeEdge(int e) |
void |
removeListener(UndirectedGraphListener l) |
V |
removeVertex(int v) |
void |
setVertexObject(int v,
V obj) |
void |
traverse(int v,
Traverser traverser) |
void |
traverse(int v,
Traverser traverser,
boolean[] encountered) |
public int addVertex()
addVertex
in interface UndirectedGraph<V,E>
public V removeVertex(int v)
removeVertex
in interface UndirectedGraph<V,E>
public int getVertexCount()
getVertexCount
in interface UndirectedGraph<V,E>
public void removeAllVertices()
removeAllVertices
in interface UndirectedGraph<V,E>
public int addEdge(int v1, int v2, E obj)
addEdge
in interface UndirectedGraph<V,E>
public E removeEdge(int e)
removeEdge
in interface UndirectedGraph<V,E>
public void removeAllEdges()
removeAllEdges
in interface UndirectedGraph<V,E>
public int getEdgeCount()
getEdgeCount
in interface UndirectedGraph<V,E>
public int[] getVertices()
getVertices
in interface UndirectedGraph<V,E>
public int[] getEdges()
getEdges
in interface UndirectedGraph<V,E>
public int getMaxVertex()
getMaxVertex
in interface UndirectedGraph<V,E>
public java.lang.Iterable<V> getVerticesObj()
getVerticesObj
in interface UndirectedGraph<V,E>
public java.util.stream.Stream<V> getVertexObjectStream()
getVertexObjectStream
in interface UndirectedGraph<V,E>
public V getVertexObject(int v)
getVertexObject
in interface UndirectedGraph<V,E>
public void setVertexObject(int v, V obj)
setVertexObject
in interface UndirectedGraph<V,E>
public int getEdgeVertex1(int e)
getEdgeVertex1
in interface UndirectedGraph<V,E>
public int getEdgeVertex2(int e)
getEdgeVertex2
in interface UndirectedGraph<V,E>
public java.lang.Iterable<E> getEdgesObject()
getEdgesObject
in interface UndirectedGraph<V,E>
public java.util.stream.Stream<E> getEdgeObjectStream()
getEdgeObjectStream
in interface UndirectedGraph<V,E>
public E getEdgeObject(int e)
getEdgeObject
in interface UndirectedGraph<V,E>
public java.util.List<E> getEdgeObjects(int v1, int v2)
getEdgeObjects
in interface UndirectedGraph<V,E>
public void traverse(int v, Traverser traverser, boolean[] encountered)
traverse
in interface UndirectedGraph<V,E>
public void traverse(int v, Traverser traverser)
traverse
in interface UndirectedGraph<V,E>
public java.util.List<gnu.trove.list.array.TIntArrayList> findAllPaths(int from, java.util.function.Function<V,java.lang.Boolean> pathComplete, java.util.function.Function<E,java.lang.Boolean> pathCanceled)
findAllPaths
in interface UndirectedGraph<V,E>
public void addListener(UndirectedGraphListener l)
addListener
in interface UndirectedGraph<V,E>
public void removeListener(UndirectedGraphListener l)
removeListener
in interface UndirectedGraph<V,E>