| Package | Description |
|---|---|
| graph.properties.splitting |
Implementations of algorithms for splitting graph into bi- and triconnected components.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<SplitComponent<V,E>> |
Splitting.findAllSplitComponents(Graph<V,E> graph,
SplitPair<V,E> splitPair) |
| Modifier and Type | Method and Description |
|---|---|
Graph<V,E> |
Splitting.splitGraph(java.util.List<SplitComponent<V,E>> splitComponents,
E edge)
A split graph of a split pair with respect of some edge
is the union of all split components which don't contain that edge
|
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
|