Bridges as an extended dispatch system
Compiling mathematical optimization problems in a multiple-dispatch context.
Last updated on 2019-10-10
10 min read
Leveraging special graph shapes in LightGraphs
In a previous post, we pushed the boundaries of the LightGraphs.jl abstraction to see how conforming the algorithms are to the declared interface, noticing some implied assumptions that were not stated.
Last updated on 2021-12-12
4 min read
Vertex removal in LightGraphs
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.
Last updated on 2020-01-06
6 min read