Uses of Class
graph.properties.components.SplitPair

Packages that use SplitPair

Package	Description
graph.properties.components	Classes representing split components and other elements associated with them, such as separation pairs.
graph.properties.splitting	Implementations of algorithms for splitting graph into bi- and triconnected components.

Uses of SplitPair in graph.properties.components

Methods in graph.properties.components that return SplitPair

Modifier and Type	Method and Description
SplitPair<V,E>	HopcroftTarjanSplitComponent.getSpearaionPair()
SplitPair<V,E>	SplitComponent.getSplitPair()

Methods in graph.properties.components with parameters of type SplitPair

Modifier and Type	Method and Description
void	HopcroftTarjanSplitComponent.setSpearaionPair(SplitPair<V,E> spearaionPair)
void	SplitComponent.setSplitPair(SplitPair<V,E> splitPair)

Constructors in graph.properties.components with parameters of type SplitPair

Constructor and Description
SplitComponent(SplitPair<V,E> splitPair, Graph<V,E> graph) Constructs a split component of the provided split pair and graph

Uses of SplitPair in graph.properties.splitting

Methods in graph.properties.splitting that return types with arguments of type SplitPair

Modifier and Type	Method and Description
java.util.List<SplitPair<V,E>>	Splitting.findAllSplitPairs(Graph<V,E> graph) Deprecated.
java.util.List<SplitPair<V,E>>	SeparationPairSplitting.findSeaparationPairs(Graph<V,E> graph) Finds all separation pairs of the given graph
java.util.Map<V,java.util.List<SplitPair<V,E>>>	SeparationPairSplitting.getSeparationPairEndVertices()
java.util.List<SplitPair<V,E>>	SeparationPairSplitting.getSeparationPairs()
java.util.Map<V,java.util.List<SplitPair<V,E>>>	SeparationPairSplitting.getSeparationPairStartVertices()
java.util.List<SplitPair<V,E>>	Splitting.maximalSplitPairs(Graph<V,E> graph, E edge) Finds a list of maximal split pair with respect to some edge A maximal split pair with respect to some edge is a split pair not dominated by any other split pair with respect to that edge There may several such pairs

Methods in graph.properties.splitting with parameters of type SplitPair

Modifier and Type	Method and Description
java.util.List<SplitComponent<V,E>>	Splitting.findAllSplitComponents(Graph<V,E> graph, SplitPair<V,E> splitPair)
Graph<V,E>	Splitting.splitGraph(SplitPair<V,E> splitPair, E edge, Graph<V,E> graph) Finds a split graph with respect to the given split pair and edge
boolean	Splitting.splitPairIsDominantedBy(Graph<V,E> graph, SplitPair<V,E> dominanted, SplitPair<V,E> dominant, E edge) Checks if one split pair is dominated by another given an edge A split pair {u,v} is dominated by another split pair {x,y} if
boolean	Splitting.splitPairIsDominantedBy(Graph<V,E> graph, SplitPair<V,E> dominanted, SplitPair<V,E> dominant, E edge) Checks if one split pair is dominated by another given an edge A split pair {u,v} is dominated by another split pair {x,y} if
boolean	Splitting.testSplitComponents(java.util.List<SplitComponent<V,E>> components, SplitPair<V,E> splitPair) All components should have two vertices in common: split pair vertices and no edges