Package graph.properties.splitting

Implementations of algorithms for splitting graph into bi- and triconnected components.

See: Description

Class Summary

Class	Description
BiconnectedSplitting<V extends Vertex,E extends Edge<V>>	Finds all biconnected components of a graph efficiently, by using the depth-first search Since the components should have the same features as block Like removal of vertex which also removed the edge, being able to find its cut vertices etc.
HopcroftTarjanSplitting<V extends Vertex,E extends Edge<V>>	Implementation based on Hopcroft and Tarjan's algorithm: J.
SeparationPairSplitting<V extends Vertex,E extends Edge<V>>	An implementation of Hopcroft-Tarjan's algorithm for finding separation pairs
Splitting<V extends Vertex,E extends Edge<V>>	A class containing methods regarding graph splitting, such as finding cut vertices Some methods need to be rewritten due to being slow

Exception Summary

Exception	Description
AlgorithmErrorException	An exception thrown if an inconsistency is detected while performing an algorithm Signalizes an implementation error.

Package graph.properties.splitting Description

Implementations of algorithms for splitting graph into bi- and triconnected components.

Author:

Renata