V - the graph vertex typeE - the graph edge typepublic class UndirectedEdgeContainer<V,E> extends Object implements Serializable
In this edge container we use array lists to minimize memory toll. However, for high-degree vertices we replace the entire edge container with a direct access subclass (to be implemented).
| Modifier and Type | Method and Description | 
|---|---|
void | 
addEdge(E e)
Add a vertex edge 
 | 
int | 
edgeCount()
Get number of vertex edges 
 | 
Set<E> | 
getUnmodifiableVertexEdges()
A lazy build of unmodifiable list of vertex edges 
 | 
void | 
removeEdge(E e)
Remove a vertex edge 
 | 
public Set<E> getUnmodifiableVertexEdges()
public void addEdge(E e)
e - the edge to addpublic int edgeCount()
public void removeEdge(E e)
e - the edge to removeCopyright © 2018. All rights reserved.