G = fiberGraph A
This function constructs the generating fibers of the configuration matrix $A$. The fibers are returned as a list of graphs where two vectors in a fiber are adjacent if their supports have non-trivial intersection.
If the option ReturnConnectedComponents is false, the default setting, then the generating fibers are exhaustively searched using a breadth first search algorithm and vectors in the fibers are added to graph objects from the package Graphs, with edges added between two vectors if they have non-trivial support.
If the option ReturnConnectedComponents is true then, instead of returning a list of graphs, the function returns a list of the connected components of each fiber. In this case, an algorithm for the computation can then be chosen using the FiberAlgorithm option and these algorithms are much more efficient than using the breadth first search algorithm alonside the Graphs package, which is used when the option ReturnConnectedComponents is false.
|
|
|
|
The object fiberGraph is a method function with options.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/AllMarkovBases.m2:797:0.