A B C D E F G H I K N O P R S T U V

A

AbstractCollectionDecorator<E> - Class in org.dishevelled.graph.impl

Abstract collection that decorates an instance of Collection.

AbstractCollectionDecorator(Collection<E>) - Constructor for class org.dishevelled.graph.impl.AbstractCollectionDecorator

Create a new abstract collection that decorates the specified collection.

AbstractGraphDecorator<N,E> - Class in org.dishevelled.graph.impl

Abstract graph that decorates an instance of Graph.

AbstractGraphDecorator(Graph<N, E>) - Constructor for class org.dishevelled.graph.impl.AbstractGraphDecorator

Create a new abstract graph that decorates the specified graph.

AbstractIteratorDecorator<E> - Class in org.dishevelled.graph.impl

Abstract iterator that decorates an instance of Iterator.

AbstractIteratorDecorator(Iterator<E>) - Constructor for class org.dishevelled.graph.impl.AbstractIteratorDecorator

Create a new abstract iterator that decorates the specified iterator.

AbstractMapDecorator<K,V> - Class in org.dishevelled.graph.impl

Abstract map that decorates an instance of Map.

AbstractMapDecorator(Map<K, V>) - Constructor for class org.dishevelled.graph.impl.AbstractMapDecorator

Create a new abstract map that decorates the specified map.

AbstractMapEntryDecorator<K,V> - Class in org.dishevelled.graph.impl

Abstract map entry decorator.

AbstractMapEntryDecorator(Map.Entry<K, V>) - Constructor for class org.dishevelled.graph.impl.AbstractMapEntryDecorator

Create a new abstract map entyr that decorates the specified map entry.

AbstractSetDecorator<E> - Class in org.dishevelled.graph.impl

Abstract set that decorates an instance of Set.

AbstractSetDecorator(Set<E>) - Constructor for class org.dishevelled.graph.impl.AbstractSetDecorator

Create a new abstract set that decorates the specified set.

add(E) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

add(E) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

addAll(Collection<? extends E>) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

addAll(Collection<? extends E>) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

B

breadthFirstSearch(Graph<N, E>, Node<N, E>, UnaryProcedure<Node<N, E>>) - Static method in class org.dishevelled.graph.impl.GraphUtils

Breadth-first search.

C

clear() - Method in interface org.dishevelled.graph.Graph

Clear the nodes and edges in this graph (optional operation).

clear() - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

clear() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Clear the nodes and edges in this graph (optional operation).

clear() - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

clear() - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

clear() - Method in class org.dishevelled.graph.impl.GraphImpl

Clear the nodes and edges in this graph (optional operation).

connectedComponents(Graph<N, E>) - Static method in class org.dishevelled.graph.impl.GraphUtils

Find the connected components of the specified graph.

contains(Object) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

contains(Object) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

containsAll(Collection<?>) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

containsAll(Collection<?>) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

containsKey(Object) - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

containsValue(Object) - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

createEdge(Node<N, E>, Node<N, E>, E) - Method in interface org.dishevelled.graph.Graph

Create and return a new edge in this graph with the specified value connecting the specified source and target nodes (optional operation).

createEdge(Node<N, E>, Node<N, E>, E) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Create and return a new edge in this graph with the specified value connecting the specified source and target nodes (optional operation).

createEdge(Node<N, E>, Node<N, E>, E) - Method in class org.dishevelled.graph.impl.GraphImpl

Create and return a new edge in this graph with the specified value connecting the specified source and target nodes (optional operation).

createGraph() - Static method in class org.dishevelled.graph.impl.GraphUtils

Create and return a new directed graph.

createGraph(int, int) - Static method in class org.dishevelled.graph.impl.GraphUtils

Create and return a new directed graph with the specified initial node and edge capacities.

createGraph(Graph<N, E>) - Static method in class org.dishevelled.graph.impl.GraphUtils

Create and return a new directed graph with the same structure and same node and edge values as the specified graph.

createNode(N) - Method in interface org.dishevelled.graph.Graph

Create and return a new node in this graph with the specified value (optional operation).

createNode(N) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Create and return a new node in this graph with the specified value (optional operation).

createNode(N) - Method in class org.dishevelled.graph.impl.GraphImpl

Create and return a new node in this graph with the specified value (optional operation).

D

degree() - Method in interface org.dishevelled.graph.Node

Return the degree of this node.

depthFirstSearch(Graph<N, E>, Node<N, E>, UnaryProcedure<Node<N, E>>) - Static method in class org.dishevelled.graph.impl.GraphUtils

Depth-first search.

E

Edge<N,E> - Interface in org.dishevelled.graph

Typed directed graph edge.

edgeCount() - Method in interface org.dishevelled.graph.Graph

Return the number of edges in this graph.

edgeCount() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return the number of edges in this graph.

edgeCount() - Method in class org.dishevelled.graph.impl.GraphImpl

Return the number of edges in this graph.

edgeMap(T) - Method in interface org.dishevelled.graph.Graph

Return a map of type <Edge<N, E>, T> with the edges in this graph as keys.

edgeMap(T) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return a map of type <Edge<N, E>, T> with the edges in this graph as keys.

edgeMap(T) - Method in class org.dishevelled.graph.impl.GraphImpl

Return a map of type <Edge<N, E>, T> with the edges in this graph as keys.

edges() - Method in interface org.dishevelled.graph.Graph

Return a read-only set view of the edges in this graph.

edges() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return a read-only set view of the edges in this graph.

edges() - Method in class org.dishevelled.graph.impl.GraphImpl

Return a read-only set view of the edges in this graph.

edgeValues() - Method in interface org.dishevelled.graph.Graph

Return a read-only collection view of the edge values in this graph.

edgeValues() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return a read-only collection view of the edge values in this graph.

edgeValues() - Method in class org.dishevelled.graph.impl.GraphImpl

Return a read-only collection view of the edge values in this graph.

entrySet() - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

equals(Object) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

equals(Object) - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

equals(Object) - Method in class org.dishevelled.graph.impl.AbstractMapEntryDecorator

equals(Object) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

F

forEachEdge(UnaryProcedure<Edge<N, E>>) - Method in interface org.dishevelled.graph.Graph

Apply the specified procedure to each edge in this graph.

forEachEdge(UnaryPredicate<Edge<N, E>>, UnaryProcedure<Edge<N, E>>) - Method in interface org.dishevelled.graph.Graph

Apply the specified procedure to each edge in this graph accepted by the specified predicate.

forEachEdge(UnaryProcedure<Edge<N, E>>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Apply the specified procedure to each edge in this graph.

forEachEdge(UnaryPredicate<Edge<N, E>>, UnaryProcedure<Edge<N, E>>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Apply the specified procedure to each edge in this graph accepted by the specified predicate.

forEachEdge(UnaryProcedure<Edge<N, E>>) - Method in class org.dishevelled.graph.impl.GraphImpl

Apply the specified procedure to each edge in this graph.

forEachEdge(UnaryPredicate<Edge<N, E>>, UnaryProcedure<Edge<N, E>>) - Method in class org.dishevelled.graph.impl.GraphImpl

Apply the specified procedure to each edge in this graph accepted by the specified predicate.

forEachEdgeValue(UnaryProcedure<? super E>) - Method in interface org.dishevelled.graph.Graph

Apply the specified procedure to each edge value in this graph.

forEachEdgeValue(UnaryPredicate<E>, UnaryProcedure<E>) - Method in interface org.dishevelled.graph.Graph

Apply the specified procedure to each edge value in this graph accepted by the specified predicate.

forEachEdgeValue(UnaryProcedure<? super E>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Apply the specified procedure to each edge value in this graph.

forEachEdgeValue(UnaryPredicate<E>, UnaryProcedure<E>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Apply the specified procedure to each edge value in this graph accepted by the specified predicate.

forEachEdgeValue(UnaryProcedure<? super E>) - Method in class org.dishevelled.graph.impl.GraphImpl

Apply the specified procedure to each edge value in this graph.

forEachEdgeValue(UnaryPredicate<E>, UnaryProcedure<E>) - Method in class org.dishevelled.graph.impl.GraphImpl

Apply the specified procedure to each edge value in this graph accepted by the specified predicate.

forEachNode(UnaryProcedure<Node<N, E>>) - Method in interface org.dishevelled.graph.Graph

Apply the specified procedure to each node in this graph.

forEachNode(UnaryPredicate<Node<N, E>>, UnaryProcedure<Node<N, E>>) - Method in interface org.dishevelled.graph.Graph

Apply the specified procedure to each node in this graph accepted by the specified predicate.

forEachNode(UnaryProcedure<Node<N, E>>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Apply the specified procedure to each node in this graph.

forEachNode(UnaryPredicate<Node<N, E>>, UnaryProcedure<Node<N, E>>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Apply the specified procedure to each node in this graph accepted by the specified predicate.

forEachNode(UnaryProcedure<Node<N, E>>) - Method in class org.dishevelled.graph.impl.GraphImpl

Apply the specified procedure to each node in this graph.

forEachNode(UnaryPredicate<Node<N, E>>, UnaryProcedure<Node<N, E>>) - Method in class org.dishevelled.graph.impl.GraphImpl

Apply the specified procedure to each node in this graph accepted by the specified predicate.

forEachNodeValue(UnaryProcedure<? super N>) - Method in interface org.dishevelled.graph.Graph

Apply the specified procedure to each node value in this graph.

forEachNodeValue(UnaryPredicate<N>, UnaryProcedure<N>) - Method in interface org.dishevelled.graph.Graph

Apply the specified procedure to each node value in this graph accepted by the specified predicate.

forEachNodeValue(UnaryProcedure<? super N>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Apply the specified procedure to each node value in this graph.

forEachNodeValue(UnaryPredicate<N>, UnaryProcedure<N>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Apply the specified procedure to each node value in this graph accepted by the specified predicate.

forEachNodeValue(UnaryProcedure<? super N>) - Method in class org.dishevelled.graph.impl.GraphImpl

Apply the specified procedure to each node value in this graph.

forEachNodeValue(UnaryPredicate<N>, UnaryProcedure<N>) - Method in class org.dishevelled.graph.impl.GraphImpl

Apply the specified procedure to each node value in this graph accepted by the specified predicate.

G

get(Object) - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

getCollection() - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

Return a reference to the collection this decorator decorates.

getGraph() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return a reference to the graph this decorator decorates.

getIterator() - Method in class org.dishevelled.graph.impl.AbstractIteratorDecorator

\ * Return a reference to the iterator this decorator decorates.

getKey() - Method in class org.dishevelled.graph.impl.AbstractMapEntryDecorator

getMap() - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

Return a reference to the map this decorator decorates.

getSet() - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

Return a reference to the set this decorator decorates.

getValue() - Method in interface org.dishevelled.graph.Edge

Return the value at this edge.

getValue() - Method in class org.dishevelled.graph.impl.AbstractMapEntryDecorator

getValue() - Method in interface org.dishevelled.graph.Node

Return the value at this node.

Graph<N,E> - Interface in org.dishevelled.graph

Directed graph with typed values on nodes and edges.

GraphImpl<N,E> - Class in org.dishevelled.graph.impl

Directed graph implementation based on two HashSets.

GraphImpl() - Constructor for class org.dishevelled.graph.impl.GraphImpl

Create a new directed graph.

GraphImpl(int, int) - Constructor for class org.dishevelled.graph.impl.GraphImpl

Create a new directed graph with the specified initial node and edge capacities.

GraphImpl(Graph<N, E>) - Constructor for class org.dishevelled.graph.impl.GraphImpl

Create a new directed graph with the same structure and same node and edge values as the specified graph (copy constructor).

GraphUtils - Class in org.dishevelled.graph.impl

Static utility methods on directed graphs.

H

hashCode() - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

hashCode() - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

hashCode() - Method in class org.dishevelled.graph.impl.AbstractMapEntryDecorator

hashCode() - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

hasNext() - Method in class org.dishevelled.graph.impl.AbstractIteratorDecorator

I

inEdges() - Method in interface org.dishevelled.graph.Node

Return a read-only set view of the edges in this graph containing this node as the target.

isEmpty() - Method in interface org.dishevelled.graph.Graph

Return true if this graph is empty.

isEmpty() - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

isEmpty() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return true if this graph is empty.

isEmpty() - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

isEmpty() - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

isEmpty() - Method in class org.dishevelled.graph.impl.GraphImpl

Return true if this graph is empty.

iterator() - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

iterator() - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

K

keySet() - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

N

next() - Method in class org.dishevelled.graph.impl.AbstractIteratorDecorator

Node<N,E> - Interface in org.dishevelled.graph

Typed directed graph node.

nodeCount() - Method in interface org.dishevelled.graph.Graph

Return the number of nodes in this graph.

nodeCount() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return the number of nodes in this graph.

nodeCount() - Method in class org.dishevelled.graph.impl.GraphImpl

Return the number of nodes in this graph.

nodeMap(T) - Method in interface org.dishevelled.graph.Graph

Return a map of type <Node<N, E>, T> with the nodes in this graph as keys.

nodeMap(T) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return a map of type <Node<N, E>, T> with the nodes in this graph as keys.

nodeMap(T) - Method in class org.dishevelled.graph.impl.GraphImpl

Return a map of type <Node<N, E>, T> with the nodes in this graph as keys.

nodes() - Method in interface org.dishevelled.graph.Graph

Return a read-only set view of the nodes in this graph.

nodes() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return a read-only set view of the nodes in this graph.

nodes() - Method in class org.dishevelled.graph.impl.GraphImpl

Return a read-only set view of the nodes in this graph.

nodeValues() - Method in interface org.dishevelled.graph.Graph

Return a read-only collection view of the node values in this graph.

nodeValues() - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Return a read-only collection view of the node values in this graph.

nodeValues() - Method in class org.dishevelled.graph.impl.GraphImpl

Return a read-only collection view of the node values in this graph.

O

org.dishevelled.graph - package org.dishevelled.graph

Directed graph interfaces.

org.dishevelled.graph.impl - package org.dishevelled.graph.impl

Implementations of the Graph interface.

outEdges() - Method in interface org.dishevelled.graph.Node

Return a read-only set view of the edges in this graph containing this node as the source.

P

put(K, V) - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

putAll(Map<? extends K, ? extends V>) - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

R

remove(Node<N, E>) - Method in interface org.dishevelled.graph.Graph

Remove the specified node and any edges connecting the node from this graph (optional operation).

remove(Edge<N, E>) - Method in interface org.dishevelled.graph.Graph

Remove the specified edge from this graph (optional operation).

remove(Object) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

remove(Node<N, E>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Remove the specified node and any edges connecting the node from this graph (optional operation).

remove(Edge<N, E>) - Method in class org.dishevelled.graph.impl.AbstractGraphDecorator

Remove the specified edge from this graph (optional operation).

remove() - Method in class org.dishevelled.graph.impl.AbstractIteratorDecorator

remove(Object) - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

remove(Object) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

remove(Node<N, E>) - Method in class org.dishevelled.graph.impl.GraphImpl

Remove the specified node and any edges connecting the node from this graph (optional operation).

remove(Edge<N, E>) - Method in class org.dishevelled.graph.impl.GraphImpl

Remove the specified edge from this graph (optional operation).

removeAll(Collection<?>) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

removeAll(Collection<?>) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

retainAll(Collection<?>) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

retainAll(Collection<?>) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

S

setValue(E) - Method in interface org.dishevelled.graph.Edge

Set the value at this edge to value (optional operation).

setValue(V) - Method in class org.dishevelled.graph.impl.AbstractMapEntryDecorator

setValue(N) - Method in interface org.dishevelled.graph.Node

Set the value at this node to value (optional operation).

size() - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

size() - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

size() - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

source() - Method in interface org.dishevelled.graph.Edge

Return the source node for this edge.

T

target() - Method in interface org.dishevelled.graph.Edge

Return the target node for this edge.

toArray() - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

toArray(T[]) - Method in class org.dishevelled.graph.impl.AbstractCollectionDecorator

toArray() - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

toArray(T[]) - Method in class org.dishevelled.graph.impl.AbstractSetDecorator

U

undirectedBreadthFirstSearch(Graph<N, E>, Node<N, E>, UnaryProcedure<Node<N, E>>) - Static method in class org.dishevelled.graph.impl.GraphUtils

Undirected breadth-first search.

unmodifiableGraph(Graph<N, E>) - Static method in class org.dishevelled.graph.impl.GraphUtils

Create and return an unmodifiable graph decorator that decorates the specified graph.

V

values() - Method in class org.dishevelled.graph.impl.AbstractMapDecorator

A B C D E F G H I K N O P R S T U V