A  B  C  D  E  G  R  S  T  U 

A

addEdge(T, T) - Method in class de .topobyte .adt .graph . Graph

Add this edge to the graph.

addEdge(T, T) - Method in class de .topobyte .adt .graph . UndirectedGraph

Add an undirected edge to the graph.

addNode(T) - Method in class de .topobyte .adt .graph . Graph

Add a node to the graph.

addNodes(Set<T>) - Method in class de .topobyte .adt .graph . Graph

Add all these nodes to the graph.

B

BreadthFirstEnumerationBuilder < T> - Class in de.topobyte.adt.graph.util

 

BreadthFirstEnumerationBuilder(Graph<T>) - Constructor for class de .topobyte .adt .graph .util . BreadthFirstEnumerationBuilder

Create a new EnumerationBuilder for the denoted graph graph.

buildEnumeration() - Method in class de .topobyte .adt .graph .util . BreadthFirstEnumerationBuilder

 

buildEnumeration() - Method in interface de .topobyte .adt .graph .util . EnumerationBuilder

Builds an enumeration of the nodes in the graph.

buildEnumeration() - Method in class de .topobyte .adt .graph .util . SimpleEnumerationBuilder

 

buildEnumeration() - Method in class de .topobyte .adt .graph .util . TopologicalEnumerationBuilder

 

C

containsEdge(T, T) - Method in class de .topobyte .adt .graph . Graph

Returns true if this graph contains the specified edge from a to b.

containsNode(T) - Method in class de .topobyte .adt .graph . Graph

Returns true if this graph contains the specified node.

D

de.topobyte.adt.graph - package de.topobyte.adt.graph

 

de.topobyte.adt.graph.util - package de.topobyte.adt.graph.util

 

degreeIn(T) - Method in class de .topobyte .adt .graph . Graph

Get the number of incoming edges.

degreeOut(T) - Method in class de .topobyte .adt .graph . Graph

Get the number of outgoing edges.

E

EnumerationBuilder < T> - Interface in de.topobyte.adt.graph.util

 

G

getEdgesIn(T) - Method in class de .topobyte .adt .graph . Graph

Get all incoming edges (the nodes that can be reached via these edges).

getEdgesOut(T) - Method in class de .topobyte .adt .graph . Graph

Get all outgoing edges (the nodes that can be reached via these edges).

getEnumeration() - Method in class de .topobyte .adt .graph .util . BreadthFirstEnumerationBuilder

 

getEnumeration() - Method in interface de .topobyte .adt .graph .util . EnumerationBuilder

Get the enumeration previously build without any computation overhead.

getEnumeration() - Method in class de .topobyte .adt .graph .util . SimpleEnumerationBuilder

 

getEnumeration() - Method in class de .topobyte .adt .graph .util . TopologicalEnumerationBuilder

 

getNodes() - Method in class de .topobyte .adt .graph . Graph

Return the nodes of this graph.

getPartition() - Method in class de .topobyte .adt .graph . Graph

Get a partition of the graph.

getReachable(T) - Method in class de .topobyte .adt .graph . Graph

Find all nodes reachable in the graph starting from the specified node.

Graph < T> - Class in de.topobyte.adt.graph

A class to represent an unweighted directed graph.

Graph() - Constructor for class de .topobyte .adt .graph . Graph

 

R

removeAllNodes(Collection<T>) - Method in class de .topobyte .adt .graph . Graph

Remove a collection of nodes from the graph.

removeEdge(T, T) - Method in class de .topobyte .adt .graph . Graph

Remove this edge from graph.

removeEdge(T, T) - Method in class de .topobyte .adt .graph . UndirectedGraph

Remove an undirected edge from graph.

removeNode(T) - Method in class de .topobyte .adt .graph . Graph

Remove a node from the graph.

reversed() - Method in class de .topobyte .adt .graph . Graph

Create a graph with the same nodes as this one, just all edges reversed.

S

SimpleEnumerationBuilder < T> - Class in de.topobyte.adt.graph.util

 

SimpleEnumerationBuilder(Graph<T>) - Constructor for class de .topobyte .adt .graph .util . SimpleEnumerationBuilder

Create a new EnumerationBuilder for the denoted graph graph.

T

TopologicalEnumerationBuilder < T> - Class in de.topobyte.adt.graph.util

 

TopologicalEnumerationBuilder(Graph<T>) - Constructor for class de .topobyte .adt .graph .util . TopologicalEnumerationBuilder

Create a new EnumerationBuilder for the denoted graph graph.

U

UndirectedGraph < T> - Class in de.topobyte.adt.graph

A class to represent an unweighted, undirected graph.

UndirectedGraph() - Constructor for class de .topobyte .adt .graph . UndirectedGraph

 

A  B  C  D  E  G  R  S  T  U