By: Julia on μβ

Re-posted from: https://matbesancon.github.io/post/2019-05-30-vertex-safe-removal/

In various graph-related algorithms, a graph is modified through successive operations, merging, creating and deleting vertices. That’s the case for the Blossom algorithm finding a best matching in a graph and using contractions of nodes. In such cases, it can be useful to keep the same vertex numbers and delete only the vertex number being contracted.
LightGraphs.jl offers a set of abstractions, types and algorithms to get started with graphs.