Package com.powsybl.openloadflow.graph
-
Interface Summary Interface Description GraphConnectivity<V,E> Interface for incremental and decremental connectivity computations, through a mechanism which records the topological changes which later need to be undone.GraphConnectivityFactory<V,E> GraphModification<V,E> -
Class Summary Class Description AbstractEdgeModification<V,E> AbstractGraphConnectivity<V,E> EdgeAdd<V,E> EdgeRemove<V,E> EvenShiloachGraphDecrementalConnectivity<V,E> 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.EvenShiloachGraphDecrementalConnectivityFactory<V,E> MinimumSpanningTreeGraphConnectivity<V,E> MinimumSpanningTreeGraphConnectivityFactory<V,E> ModificationsContext<V,E> NaiveGraphConnectivity<V,E> NaiveGraphConnectivityFactory<V,E> VertexAdd<V,E>