Gammoid (source code)
= Gammoid
{wiki=Gammoid}
A gammoid is a specific type of mathematical structure used in graph theory and combinatorial optimization. More formally, a gammoid is a type of directed graph that can be represented in terms of a certain set of vertices and directed edges, whereby subsets of vertices correspond to particular properties regarding the acyclic nature of the graph and the connectivity of its components. Gammoids can be interpreted through the lens of matroid theory, where they relate to the notion of strong connectivity and directed paths.
Back to article page
