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

T

Tarjan<V,W extends java.lang.Number> - Class in berack96.lib.graph.visit.impl

Class that implements the Tarjan algorithm and uses it for getting the SCC and the topological sort

Tarjan() - Constructor for class berack96.lib.graph.visit.impl.Tarjan

timeDiscovered - Variable in class berack96.lib.graph.visit.impl.VisitInfo.VertexInfo

timeVisited - Variable in class berack96.lib.graph.visit.impl.VisitInfo.VertexInfo

topologicalSort() - Method in interface berack96.lib.graph.Graph

If the current graph is a DAG, it returns a topological sort of this graph.
A topological ordering of a graph is a linear ordering of its vertices such that for every directed edge (V1, V2) from vertex V1 to vertex V2, V2 comes before V1 in the ordering.

topologicalSort() - Method in class berack96.lib.graph.impl.AdjGraph

topologicalSort() - Method in class berack96.lib.graph.impl.MapGraph

topologicalSort() - Method in class berack96.lib.graph.impl.MatrixGraph

toString() - Method in class berack96.lib.graph.Edge

toString() - Method in class berack96.lib.graph.Vertex

toString() - Method in class berack96.lib.graph.view.vertex.VertexComponent

toString() - Method in class berack96.lib.graph.visit.impl.VisitInfo.VertexInfo

transpose() - Method in interface berack96.lib.graph.Graph

This method will create a new Graph that is the transposed version of the original.
At the end of this method the new graph will have all the edges inverted in orientation.
Example: if the graph G contains (V1, V2, V3) as vertex, and (V1->V2, V3->V2) as edges, the transpose graph G' will contain (V1, V2, V3) as vertex, and (V2->V1, V2->V3) as edges.

transpose() - Method in class berack96.lib.graph.impl.AdjGraph

transpose() - Method in class berack96.lib.graph.impl.MapGraph

transpose() - Method in class berack96.lib.graph.impl.MatrixGraph

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