GraphDecrementalConnectivity (powsybl open loadflow 0.11.0 API)

All Known Implementing Classes:

EvenShiloachGraphDecrementalConnectivity, MinimumSpanningTreeGraphDecrementalConnectivity, NaiveGraphDecrementalConnectivity
```
public interface GraphDecrementalConnectivity<V>
```
Author:

Geoffroy Jamgotchian

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`void`	`addEdge(V vertex1, V vertex2)`
`void`	`addVertex(V vertex)`
`void`	`cut(V vertex1, V vertex2)`	Cut one edge between given vertices
`int`	`getComponentNumber(V vertex)`	Return the number of the connected component containing the given vertex, knowing that the number represents the size ranking of the related connected component in the graph, 0 being the main connected component.
`Set<V>`	`getConnectedComponent(V vertex)`
`Set<V>`	`getNonConnectedVertices(V vertex)`
`Collection<Set<V>>`	`getSmallComponents()`	Return the collection of "small" connected components, meaning all the connected components except the biggest one (size-wise).
`void`	`reset()`	Reset all the cut done previously in the graph

- Method Detail
  - addVertex
```
void addVertex(V vertex)
```
  - addEdge
```
void addEdge(V vertex1,
             V vertex2)
```
  - cut
```
void cut(V vertex1,
         V vertex2)
```
    Cut one edge between given vertices
    
    Parameters:
    
    vertex1 - first vertex, from or towards which the edge has been constructed
    
    vertex2 - second vertex, towards or from which the edge has been constructed
  - reset
```
void reset()
```
    Reset all the cut done previously in the graph
  - getComponentNumber
```
int getComponentNumber(V vertex)
```
    Return the number of the connected component containing the given vertex, knowing that the number represents the size ranking of the related connected component in the graph, 0 being the main connected component. Hence, the greater the component number is, the smaller the number of vertices in that component.
    
    Parameters:
    
    vertex - the vertex whose connected component number is looked for
    
    Returns:
    
    the number of the related connected component
  - getSmallComponents
```
Collection<Set<V>> getSmallComponents()
```
    Return the collection of "small" connected components, meaning all the connected components except the biggest one (size-wise).
    
    Returns:
    
    the collection of small connected components
  - getConnectedComponent
```
Set<V> getConnectedComponent(V vertex)
```
  - getNonConnectedVertices
```
Set<V> getNonConnectedVertices(V vertex)
```