A  B  C  D  E  F  G  H  M  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(Collection<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.
BreadthFirstEnumerationBuilder(Graph<T>, SetFactory<T>) - Constructor for class de .topobyte .adt .graph .util . BreadthFirstEnumerationBuilder
Create a new EnumerationBuilder for the denoted graph.
buildEnumeration() - Method in class de .topobyte .adt .graph .util . DepthFirstPostOrderEnumerationBuilder
 
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

chooseNext(List<T>, Set<T>) - Method in class de .topobyte .adt .graph .util . BreadthFirstEnumerationBuilder
 
chooseNext(List<T>, Set<T>) - Method in class de .topobyte .adt .graph .util . DepthFirstEnumerationBuilder
 
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.
create() - Method in class de .topobyte .adt .graph .factories . HashMapFactory
 
create() - Method in class de .topobyte .adt .graph .factories . HashSetFactory
 
create() - Method in interface de .topobyte .adt .graph .factories . MapFactory
 
create() - Method in interface de .topobyte .adt .graph .factories . SetFactory
 
create() - Method in class de .topobyte .adt .graph .factories . TreeMapFactory
 
create() - Method in class de .topobyte .adt .graph .factories . TreeSetFactory
 
createList() - Method in class de .topobyte .adt .graph .util . BreadthFirstEnumerationBuilder
 
createList() - Method in class de .topobyte .adt .graph .util . DepthFirstEnumerationBuilder
 

D

de.topobyte.adt.graph - package de.topobyte.adt.graph
 
de.topobyte.adt.graph.factories - package de.topobyte.adt.graph.factories
 
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.
DepthFirstEnumerationBuilder < T> - Class in de.topobyte.adt.graph.util
 
DepthFirstEnumerationBuilder(Graph<T>) - Constructor for class de .topobyte .adt .graph .util . DepthFirstEnumerationBuilder
Create a new EnumerationBuilder for the denoted graph.
DepthFirstEnumerationBuilder(Graph<T>, SetFactory<T>) - Constructor for class de .topobyte .adt .graph .util . DepthFirstEnumerationBuilder
Create a new EnumerationBuilder for the denoted graph.
DepthFirstPostOrderEnumerationBuilder < T> - Class in de.topobyte.adt.graph.util
 
DepthFirstPostOrderEnumerationBuilder(Graph<T>) - Constructor for class de .topobyte .adt .graph .util . DepthFirstPostOrderEnumerationBuilder
 
DepthFirstPostOrderEnumerationBuilder(Graph<T>, SetFactory<T>) - Constructor for class de .topobyte .adt .graph .util . DepthFirstPostOrderEnumerationBuilder
 

E

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

F

find(Graph<T>) - Static method in class de .topobyte .adt .graph .util . StronglyConnnectedComponents
 
findKosaraju(Graph<T>) - Static method in class de .topobyte .adt .graph .util . StronglyConnnectedComponents
 

G

getEdgesIn(T) - Method in class de .topobyte .adt .graph . Graph
Get all incoming edges (the nodes that are the origin of 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 . DepthFirstPostOrderEnumerationBuilder
 
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
 
Graph(SetFactory<T>, MapFactory<T, Set<T>>) - Constructor for class de .topobyte .adt .graph . Graph
 

H

HashMapFactory < K , V> - Class in de.topobyte.adt.graph.factories
 
HashMapFactory() - Constructor for class de .topobyte .adt .graph .factories . HashMapFactory
 
HashSetFactory < T> - Class in de.topobyte.adt.graph.factories
 
HashSetFactory() - Constructor for class de .topobyte .adt .graph .factories . HashSetFactory
 

M

MapFactory < K , V> - Interface in de.topobyte.adt.graph.factories
 

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

SetFactory < T> - Interface in de.topobyte.adt.graph.factories
 
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.
StronglyConnnectedComponents - Class in de.topobyte.adt.graph.util
 
StronglyConnnectedComponents() - Constructor for class de .topobyte .adt .graph .util . StronglyConnnectedComponents
 

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.
TreeMapFactory < K , V> - Class in de.topobyte.adt.graph.factories
 
TreeMapFactory() - Constructor for class de .topobyte .adt .graph .factories . TreeMapFactory
 
TreeSetFactory < T> - Class in de.topobyte.adt.graph.factories
 
TreeSetFactory() - Constructor for class de .topobyte .adt .graph .factories . TreeSetFactory
 

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
 
UndirectedGraph(SetFactory<T>, MapFactory<T, Set<T>>) - Constructor for class de .topobyte .adt .graph . UndirectedGraph
 
A  B  C  D  E  F  G  H  M  R  S  T  U