Package com.powsybl.openloadflow.graph

Class EvenShiloachGraphDecrementalConnectivity<V>

java.lang.Object

com.powsybl.openloadflow.graph.EvenShiloachGraphDecrementalConnectivity<V>

All Implemented Interfaces:

GraphDecrementalConnectivity<V>

public class EvenShiloachGraphDecrementalConnectivity<V>
extends Object
implements GraphDecrementalConnectivity<V>

Implementing the Even-Shiloach algorithm (see https://dl.acm.org/doi/10.1145/322234.322235) Due to time computation optimizations, this current implementation is only for graphs which initially have ONLY ONE connected component. If more, an exception is thrown.

Author:

Geoffroy Jamgotchian , Florian Dupuy

Constructor Summary

Constructors

Constructor	Description
EvenShiloachGraphDecrementalConnectivity()

Method Summary

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)
List<Set<V>>	getSmallComponents()	Return the collection of "small" connected components, meaning all the connected components except the biggest one (size-wise).
void	initLevels()
void	reset()	Reset all the cut done previously in the graph

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

EvenShiloachGraphDecrementalConnectivity

public EvenShiloachGraphDecrementalConnectivity()

Method Detail

addVertex

public void addVertex(V vertex)

Specified by:

addVertex in interface GraphDecrementalConnectivity<V>

addEdge

public void addEdge(V vertex1,
                    V vertex2)

Specified by:

addEdge in interface GraphDecrementalConnectivity<V>

cut

public void cut(V vertex1,
                V vertex2)

Description copied from interface: GraphDecrementalConnectivity

Cut one edge between given vertices

Specified by:

cut in interface GraphDecrementalConnectivity<V>

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

initLevels

public void initLevels()

reset

public void reset()

Description copied from interface: GraphDecrementalConnectivity

Reset all the cut done previously in the graph

Specified by:

reset in interface GraphDecrementalConnectivity<V>

getComponentNumber

public int getComponentNumber(V vertex)

Description copied from interface: GraphDecrementalConnectivity

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.

Specified by:

getComponentNumber in interface GraphDecrementalConnectivity<V>

Parameters:

vertex - the vertex whose connected component number is looked for

Returns:

the number of the related connected component

getSmallComponents

public List<Set<V>> getSmallComponents()

Description copied from interface: GraphDecrementalConnectivity

Return the collection of "small" connected components, meaning all the connected components except the biggest one (size-wise).

Specified by:

getSmallComponents in interface GraphDecrementalConnectivity<V>

Returns:

the collection of small connected components

getConnectedComponent

public Set<V> getConnectedComponent(V vertex)

Specified by:

getConnectedComponent in interface GraphDecrementalConnectivity<V>

getNonConnectedVertices

public Set<V> getNonConnectedVertices(V vertex)

Specified by:

getNonConnectedVertices in interface GraphDecrementalConnectivity<V>