util.graph

Class AdjacencyList<E extends DirectedEdge<?,E>>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractList<E>

java.util.ArrayList<EdgeList<E>>

util.graph.AdjacencyList<E>

Type Parameters:

E - the edge type of the graph

All Implemented Interfaces:

java.io.Serializable, java.lang.Cloneable, java.lang.Iterable<EdgeList<E>>, java.util.Collection<EdgeList<E>>, java.util.List<EdgeList<E>>, java.util.RandomAccess

public final class AdjacencyList<E extends DirectedEdge<?,E>>
extends java.util.ArrayList<EdgeList<E>>

Represents the AdjacencyList of a Graph.

See Also:

Serialized Form

Field Summary

Fields inherited from class java.util.AbstractList

modCount

Constructor Summary

Constructors

Constructor and Description
AdjacencyList(int count) Creates a new AdjacenyList for a graph with count vertices

Method Summary

Modifier and Type	Method and Description
void	append(int vertex, E edge) Appends an edge to the adjacency of a given vertex.
EdgeList<E>	get(int vertex) Returns an EdgeList of edges for a given vertex.
static <T,E extends DirectedEdge<T,E>> AdjacencyList<E>	of(Graph<E> g) Takes a Graph graph and transforms it into an AdjacencyList
static <T,E extends DirectedEdge<T,E>> AdjacencyList<E>	of(int vertices, java.lang.Iterable<? extends E> edges) Takes a graph given by the number of vertices and an Iterable of edges and transforms it into an AdjacencyList
java.lang.String	toString()

Methods inherited from class java.util.ArrayList

add, add, addAll, addAll, clear, clone, contains, ensureCapacity, forEach, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeIf, removeRange, replaceAll, retainAll, set, size, sort, spliterator, subList, toArray, toArray, trimToSize

Methods inherited from class java.util.AbstractList

equals, hashCode

Methods inherited from class java.util.AbstractCollection

containsAll

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.List

containsAll, equals, hashCode

Methods inherited from interface java.util.Collection

parallelStream, stream

Constructor Detail

AdjacencyList

public AdjacencyList(int count)

Creates a new AdjacenyList for a graph with count vertices

Parameters:

count - the number of vertices in the AdjacencyList

Method Detail

of

public static <T,E extends DirectedEdge<T,E>> AdjacencyList<E> of(Graph<E> g)

Takes a Graph graph and transforms it into an AdjacencyList

Type Parameters:

T - the weight type of the edges in the graph

E - the edge type of the edges in the graph

Parameters:

g - the Graph to be transformed

Returns:

the AdjacencyList for the given Graph

of

public static <T,E extends DirectedEdge<T,E>> AdjacencyList<E> of(int vertices,
                                                                  java.lang.Iterable<? extends E> edges)

Takes a graph given by the number of vertices and an Iterable of edges and transforms it into an AdjacencyList

Type Parameters:

T - the weight type of the edges in the graph

E - the edge type of the edges in the graph

Parameters:

vertices - the number of vertices

edges - an Iterable of edges

Returns:

the AdjacencyList for the given Graph

get

public EdgeList<E> get(int vertex)

Returns an EdgeList of edges for a given vertex.

Specified by:

get in interface java.util.List<EdgeList<E extends DirectedEdge<?,E>>>

Overrides:

get in class java.util.ArrayList<EdgeList<E extends DirectedEdge<?,E>>>

Parameters:

vertex - specifies the vertex

Returns:

returns an EdgeList of edges for the given vertex

append

public void append(int vertex,
                   E edge)

Appends an edge to the adjacency of a given vertex.

Parameters:

vertex - specifies the vertex

edge - the edge to be appended

toString

public java.lang.String toString()

Overrides:

toString in class java.util.AbstractCollection<EdgeList<E extends DirectedEdge<?,E>>>