- c -
- considered : ElementData +
- constructAllGraphs +: CMR_SEYMOUR_PARAMS + +
- constructLeafGraphs +: CMR_SEYMOUR_PARAMS +
- currentStack : CMR_ENVIRONMENT diff --git a/functions_d.html b/functions_d.html index 542cba51..1650a5fe 100644 --- a/functions_d.html +++ b/functions_d.html @@ -79,9 +79,6 @@
- d -
- d -
- depth : _ReducedMember -
- directCamion -: CMR_TU_PARAMS -
- directGraphicness -: CMR_REGULAR_PARAMS +: CMR_SEYMOUR_PARAMS
- distance
: ElementData
diff --git a/functions_e.html b/functions_e.html
index 5f7e6f14..5f884584 100644
--- a/functions_e.html
+++ b/functions_e.html
@@ -115,19 +115,19 @@
- e -
- enumerationCandidatesCount -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- enumerationColumnSubsets : CMR_TU_STATS
- enumerationCount -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- enumerationRowSubsets : CMR_TU_STATS
- enumerationTime -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS , CMR_TU_STATS
- errorMessage
diff --git a/functions_g.html b/functions_g.html
index 55285312..706fc015 100644
--- a/functions_g.html
+++ b/functions_g.html
@@ -98,14 +98,11 @@
- g -
- graphic : CMR_NETWORK_STATISTICS -, CMR_REGULAR_STATS +, CMR_SEYMOUR_STATS
- graphicness : _CMR_SEYMOUR_NODE -
- graphs -: CMR_REGULAR_PARAMS -
- graphTime : CMR_CAMION_STATISTICS diff --git a/functions_n.html b/functions_n.html index 4bb00974..d8e3c25c 100644 --- a/functions_n.html +++ b/functions_n.html @@ -109,7 +109,7 @@
- network -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- next
: CMR_GRAPH_ARC_DATA
diff --git a/functions_p.html b/functions_p.html
index 65625f1b..2f437c7a 100644
--- a/functions_p.html
+++ b/functions_p.html
@@ -79,7 +79,7 @@
- p -
-
: Dec
- params -: DecompositionTask +: DecompositionTask
- parent
: _ReducedMember
@@ -117,7 +117,7 @@
- p -
- planarityCheck -: CMR_REGULAR_PARAMS +: CMR_SEYMOUR_PARAMS
- positions
: CMR_INTHEAP
@@ -135,6 +135,9 @@
- p -
- predecessorValue : GRAPH_NODE +
- preferGraphicness +: CMR_SEYMOUR_PARAMS +
- prev
: CMR_GRAPH_ARC_DATA
, CMR_GRAPH_NODE_DATA
diff --git a/functions_r.html b/functions_r.html
index 9544c977..2e26cfdb 100644
--- a/functions_r.html
+++ b/functions_r.html
@@ -90,9 +90,6 @@
- r -
- reduceTime : CMR_SP_STATISTICS -
- regular -: CMR_TU_PARAMS -
- regularity : _CMR_SEYMOUR_NODE diff --git a/functions_s.html b/functions_s.html index 8632b5b5..43f0c53f 100644 --- a/functions_s.html +++ b/functions_s.html @@ -76,26 +76,32 @@
- sequenceExtensionCount -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- sequenceExtensionTime -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- sequenceGraphicCount -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- sequenceGraphicTime -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- seriesParallel : CMR_BALANCED_PARAMS , CMR_BALANCED_STATS -, CMR_REGULAR_PARAMS -, CMR_REGULAR_STATS +, CMR_SEYMOUR_PARAMS +, CMR_SEYMOUR_STATS
- seriesParallelReductions : _CMR_SEYMOUR_NODE +
- seymour +: CMR_REGULAR_PARAMS +, CMR_REGULAR_STATS +, CMR_TU_PARAMS +, CMR_TU_STATS +
- sign
: NetworkNodeData
, OrientationSearchNodeData
@@ -126,12 +132,24 @@
- s -
- stats : CMR_BALANCED_ENUMERATION , CMR_TU_ENUMERATION -, DecompositionTask +, DecompositionTask
- status : GRAPH_NODE , GraphNode +
- stopWhenIrregular +: CMR_SEYMOUR_PARAMS + +
- stopWhenNeitherGraphicNorCoGraphic +: CMR_SEYMOUR_PARAMS + +
- stopWhenNoncographic +: CMR_SEYMOUR_PARAMS + +
- stopWhenNongraphic +: CMR_SEYMOUR_PARAMS +
- subsetRows
: CMR_BALANCED_ENUMERATION
, CMR_TU_ENUMERATION
diff --git a/functions_t.html b/functions_t.html
index 49d888a6..e6d50f28 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -90,6 +90,9 @@
- t -
- terminalNode : _ReducedComponent +
- ternary +: CMR_TU_PARAMS +
- testedR10 : _CMR_SEYMOUR_NODE @@ -100,13 +103,13 @@
- t -
- threesumFlags -: _CMR_SEYMOUR_NODE +: _CMR_SEYMOUR_NODE
- threeSumPivotChildren -: CMR_REGULAR_PARAMS +: CMR_SEYMOUR_PARAMS
- threeSumStrategy -: CMR_REGULAR_PARAMS +: CMR_SEYMOUR_PARAMS
- timeLimit
: CMR_BALANCED_ENUMERATION
@@ -123,7 +126,7 @@
- t -
- totalTime
@@ -133,7 +136,7 @@
- t -
- transpose
@@ -146,9 +149,6 @@
- t -
- transposeTime : CMR_GRAPHIC_STATISTICS -
- treeFlags -: CMR_REGULAR_PARAMS -
- tu
: CMR_CTU_PARAMS
, CMR_CTU_STATISTICS
diff --git a/functions_vars_c.html b/functions_vars_c.html
index 69459280..16ad958b 100644
--- a/functions_vars_c.html
+++ b/functions_vars_c.html
@@ -77,7 +77,10 @@
- c -
- camion : CMR_NETWORK_STATISTICS -, CMR_REGULAR_STATS +, CMR_TU_STATS + +
- camionFirst +: CMR_TU_PARAMS
- cardinality
: CMR_BALANCED_ENUMERATION
@@ -170,6 +173,12 @@
- c -
- considered : ElementData +
- constructAllGraphs +: CMR_SEYMOUR_PARAMS + +
- constructLeafGraphs +: CMR_SEYMOUR_PARAMS +
- currentStack : CMR_ENVIRONMENT diff --git a/functions_vars_d.html b/functions_vars_d.html index d1b8e29f..f1cfa4bb 100644 --- a/functions_vars_d.html +++ b/functions_vars_d.html @@ -79,9 +79,6 @@
- d -
- - decomposition -: CMR_TU_STATS -
- degree : GraphNode @@ -97,11 +94,8 @@
- depth : _ReducedMember -
- directCamion -: CMR_TU_PARAMS -
- directGraphicness -: CMR_REGULAR_PARAMS +: CMR_SEYMOUR_PARAMS
- distance
: ElementData
diff --git a/functions_vars_e.html b/functions_vars_e.html
index 65628770..d3da01aa 100644
--- a/functions_vars_e.html
+++ b/functions_vars_e.html
@@ -115,19 +115,19 @@
- e -
- enumerationCandidatesCount -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- enumerationColumnSubsets : CMR_TU_STATS
- enumerationCount -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- enumerationRowSubsets : CMR_TU_STATS
- enumerationTime -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS , CMR_TU_STATS
- errorMessage
diff --git a/functions_vars_g.html b/functions_vars_g.html
index e6d2e7ae..70be311f 100644
--- a/functions_vars_g.html
+++ b/functions_vars_g.html
@@ -98,14 +98,11 @@
- g -
- graphic : CMR_NETWORK_STATISTICS -, CMR_REGULAR_STATS +, CMR_SEYMOUR_STATS
- graphicness : _CMR_SEYMOUR_NODE -
- graphs -: CMR_REGULAR_PARAMS -
- graphTime : CMR_CAMION_STATISTICS diff --git a/functions_vars_n.html b/functions_vars_n.html index cc152f81..06f5656b 100644 --- a/functions_vars_n.html +++ b/functions_vars_n.html @@ -109,7 +109,7 @@
- d -
- n -
- network -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- next
: CMR_GRAPH_ARC_DATA
diff --git a/functions_vars_p.html b/functions_vars_p.html
index 50262c08..67bf546c 100644
--- a/functions_vars_p.html
+++ b/functions_vars_p.html
@@ -79,7 +79,7 @@
- p -
-
: Dec
- params -: DecompositionTask +: DecompositionTask
- parent
: _ReducedMember
@@ -117,7 +117,7 @@
- p -
- planarityCheck -: CMR_REGULAR_PARAMS +: CMR_SEYMOUR_PARAMS
- positions
: CMR_INTHEAP
@@ -135,6 +135,9 @@
- p -
- predecessorValue : GRAPH_NODE +
- preferGraphicness +: CMR_SEYMOUR_PARAMS +
- prev
: CMR_GRAPH_ARC_DATA
, CMR_GRAPH_NODE_DATA
diff --git a/functions_vars_r.html b/functions_vars_r.html
index d487e081..364a9e3f 100644
--- a/functions_vars_r.html
+++ b/functions_vars_r.html
@@ -90,9 +90,6 @@
- r -
- reduceTime : CMR_SP_STATISTICS -
- regular -: CMR_TU_PARAMS -
- regularity : _CMR_SEYMOUR_NODE diff --git a/functions_vars_s.html b/functions_vars_s.html index 0a508a5c..df98960d 100644 --- a/functions_vars_s.html +++ b/functions_vars_s.html @@ -76,26 +76,32 @@
- sequenceExtensionCount -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- sequenceExtensionTime -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- sequenceGraphicCount -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- sequenceGraphicTime -: CMR_REGULAR_STATS +: CMR_SEYMOUR_STATS
- seriesParallel : CMR_BALANCED_PARAMS , CMR_BALANCED_STATS -, CMR_REGULAR_PARAMS -, CMR_REGULAR_STATS +, CMR_SEYMOUR_PARAMS +, CMR_SEYMOUR_STATS
- seriesParallelReductions : _CMR_SEYMOUR_NODE +
- seymour +: CMR_REGULAR_PARAMS +, CMR_REGULAR_STATS +, CMR_TU_PARAMS +, CMR_TU_STATS +
- sign
: NetworkNodeData
, OrientationSearchNodeData
@@ -126,12 +132,24 @@
- s -
- stats : CMR_BALANCED_ENUMERATION , CMR_TU_ENUMERATION -, DecompositionTask +, DecompositionTask
- status : GRAPH_NODE , GraphNode +
- stopWhenIrregular +: CMR_SEYMOUR_PARAMS + +
- stopWhenNeitherGraphicNorCoGraphic +: CMR_SEYMOUR_PARAMS + +
- stopWhenNoncographic +: CMR_SEYMOUR_PARAMS + +
- stopWhenNongraphic +: CMR_SEYMOUR_PARAMS +
- subsetRows
: CMR_BALANCED_ENUMERATION
, CMR_TU_ENUMERATION
diff --git a/functions_vars_t.html b/functions_vars_t.html
index 9cbea63e..9a81d696 100644
--- a/functions_vars_t.html
+++ b/functions_vars_t.html
@@ -90,6 +90,9 @@
- t -
- terminalNode : _ReducedComponent +
- ternary +: CMR_TU_PARAMS +
- testedR10 : _CMR_SEYMOUR_NODE @@ -100,13 +103,13 @@
- t -
- threesumFlags -: _CMR_SEYMOUR_NODE +: _CMR_SEYMOUR_NODE
- threeSumPivotChildren -: CMR_REGULAR_PARAMS +: CMR_SEYMOUR_PARAMS
- threeSumStrategy -: CMR_REGULAR_PARAMS +: CMR_SEYMOUR_PARAMS
- timeLimit
: CMR_BALANCED_ENUMERATION
@@ -123,7 +126,7 @@
- t -
- totalTime
@@ -133,7 +136,7 @@
- t -
- transpose
@@ -146,9 +149,6 @@
- t -
- transposeTime : CMR_GRAPHIC_STATISTICS -
- treeFlags -: CMR_REGULAR_PARAMS -
- tu
: CMR_CTU_PARAMS
, CMR_CTU_STATISTICS
diff --git a/globals_c.html b/globals_c.html
index 8a4c61c4..0f1de095 100644
--- a/globals_c.html
+++ b/globals_c.html
@@ -108,17 +108,8 @@
- c -
- CMR_CALL : env.h -
- CMR_DEC_CONSTRUCT -: regular.h - -
- CMR_DEC_CONSTRUCT_ALL -: regular.h - -
- CMR_DEC_CONSTRUCT_LEAVES -: regular.h - -
- CMR_DEC_CONSTRUCT_NONE -: regular.h +
- CMR_DEBUG +: tu.c
- CMR_ELEMENT
: element.h
@@ -186,6 +177,9 @@
- c -
- CMR_MINOR_TYPE_DETERMINANT : matroid.h +
- CMR_MINOR_TYPE_ENTRY +: matroid.h +
- CMR_MINOR_TYPE_FANO : matroid.h @@ -210,27 +204,6 @@
- CMR_OKAY : env.h -
- CMR_REGULAR_TREE_FLAGS -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_DEFAULT -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_RECURSE -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_STOP_IRREGULAR -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_STOP_NONCOGRAPHIC -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_STOP_NONGRAPHIC -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_STOP_NONGRAPHIC_NONCOGRAPHIC -: regular.h -
- CMR_SEPA_FIRST : separation.h @@ -267,48 +240,6 @@
- CMR_SEYMOUR_NODE : seymour.h -
- CMR_SEYMOUR_NODE_THREESUM_FLAG -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_CONCENTRATED_RANK -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_DISTRIBUTED_RANKS -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_ALLREPR -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_MIXED -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_TALL -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_WIDE -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_NO_PIVOTS -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_ALLREPR -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_MIXED -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_TALL -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_WIDE -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SEYMOUR -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_TRUEMPER -: seymour.h -
- CMR_SEYMOUR_NODE_TYPE : seymour.h @@ -345,6 +276,48 @@
- CMR_SEYMOUR_NODE_TYPE_UNKNOWN : seymour.h +
- CMR_SEYMOUR_THREESUM_FLAG +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_CONCENTRATED_RANK +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_DISTRIBUTED_RANKS +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_ALLREPR +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_MIXED +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_TALL +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_WIDE +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_NO_PIVOTS +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_ALLREPR +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_MIXED +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_TALL +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_WIDE +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SEYMOUR +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_TRUEMPER +: seymour.h +
- CMR_TU_ALGORITHM : tu.h @@ -373,12 +346,12 @@
- c -
- c -
- c -
- c -
- CMRassertStackConsistency() -: env.c -, env_internal.h +: env_internal.h +, env.c
- CMRbalancedParamsInit() -: balanced.c -, balanced.h +: balanced.h +, balanced.c
- CMRbalancedStatsInit()
: balanced.h
@@ -397,8 +370,8 @@
- c -
-
, camion.c
- CMRcamionComputeSigns() -: camion.h -, camion.c +: camion.c +, camion.h
- CMRcamionComputeSignSequentiallyConnected()
: camion.c
@@ -429,8 +402,8 @@
- c -
-
, matrix.c
- CMRchrmatCheckEqual() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRchrmatCheckTranspose()
: matrix.h
@@ -449,12 +422,12 @@
- c -
-
, matrix.c
- CMRchrmatCreateFromDenseFile() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRchrmatCreateFromDenseStream() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRchrmatCreateFromSparseFile()
: matrix.h
@@ -473,8 +446,8 @@
- c -
- CMRchrmatFindEntry() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRchrmatFree()
: matrix.h
@@ -525,8 +498,8 @@
- c -
-
, matrix.c
- CMRchrmatTranspose() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRchrmatZoomSubmat()
: matrix.h
@@ -576,12 +549,12 @@
- c -
- CMRdblmatChangeNumNonzeros() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRdblmatCheckEqual() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRdblmatCheckTranspose()
: matrix.h
@@ -636,8 +609,8 @@
- c -
-
, matrix.c
- CMRdblmatIsTernary() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRdblmatPermute()
: matrix.h
@@ -660,8 +633,8 @@
- c -
-
, matrix.c
- CMRdblmatSupport() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRdblmatTranspose()
: matrix.h
@@ -718,8 +691,8 @@
- c -
- CMRdensebinmatrixFree() -: densematrix.c -, densematrix.h +: densematrix.h +, densematrix.c
- CMRdensebinmatrixGet()
: densematrix.h
@@ -746,8 +719,8 @@
- c -
- CMRelementString() -: element.h -, element.c +: element.c +, element.h
- CMRelementToColumnIndex()
: element.h
@@ -771,8 +744,8 @@
- c -
- CMRequimodularTest() -: equimodular.h -, equimodular.c +: equimodular.c +, equimodular.h
- CMRequimodularTestStrong()
: equimodular.h
@@ -801,8 +774,8 @@
- c -
- CMRgetErrorMessage() -: env.h -, env.c +: env.c +, env.h
- CMRgetStackUsage()
: env.c
@@ -825,8 +798,8 @@
- c -
-
, graph.c
- CMRgraphCreateEmpty() -: graph.h -, graph.c +: graph.c +, graph.h
- CMRgraphCreateFromEdgeList()
: graph.h
@@ -862,8 +835,8 @@
- c -
-
: graph.c
- CMRgraphFree() -: graph.h -, graph.c +: graph.c +, graph.h
- CMRgraphicComputeMatrix()
: graphic.h
@@ -885,8 +858,8 @@
- c -
- CMRgraphicTestTranspose() -: graphic.h -, graphic.c +: graphic.c +, graphic.h
- CMRgraphIncEdge()
: graph.h
@@ -932,12 +905,12 @@
- c -
-
: graph.h
- CMRgraphPrint() -: graph.c -, graph.h +: graph.h +, graph.c
- CMRintheapClearStack() -: heap.h -, heap.c +: heap.c +, heap.h
- CMRintheapContains()
: heap.h
@@ -954,8 +927,8 @@
- c -
-
: heap.h
- CMRintheapExtractMinimum() -: heap.c -, heap.h +: heap.h +, heap.c
- CMRintheapGetValue()
: heap.h
@@ -978,8 +951,8 @@
- c -
-
: heap.h
- CMRintmatChangeNumNonzeros() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRintmatCheckEqual()
: matrix.h
@@ -1010,8 +983,8 @@
- c -
-
, matrix.c
- CMRintmatCreateFromDenseStream() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRintmatCreateFromSparseFile()
: matrix.h
@@ -1026,8 +999,8 @@
- c -
- CMRintmatFindEntry() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRintmatFree()
: matrix.h
@@ -1094,8 +1067,8 @@
- c -
- CMRlinearhashtableArrayInsertBucketHash() -: hashtable.h -, hashtable.c +: hashtable.c +, hashtable.h
- CMRlinearhashtableArrayKey()
: hashtable.c
@@ -1110,16 +1083,16 @@
- c -
- CMRlisthashtableFindFirst() -: hashtable.c -, hashtable.h +: hashtable.h +, hashtable.c
- CMRlisthashtableFindNext() : hashtable.c , hashtable.h
- CMRlisthashtableFree() -: hashtable.h -, hashtable.c +: hashtable.c +, hashtable.h
- CMRlisthashtableHash()
: hashtable.c
@@ -1134,8 +1107,8 @@
- c -
- CMRlisthashtableRemove() -: hashtable.c -, hashtable.h +: hashtable.h +, hashtable.c
- CMRlisthashtableValue()
: hashtable.c
@@ -1190,8 +1163,8 @@
- c -
- CMRlistmat8Free() -: listmatrix.h -, listmatrix.c +: listmatrix.c +, listmatrix.h
- CMRlistmat8InitializeFromChrMatrix()
: listmatrix.c
@@ -1212,12 +1185,12 @@
- c -
- CMRlistmat8InitializeZero() -: listmatrix.c -, listmatrix.h +: listmatrix.h +, listmatrix.c
- CMRlistmat8Insert() -: listmatrix.h -, listmatrix.c +: listmatrix.c +, listmatrix.h
- CMRlistmat8PrintDense()
: listmatrix.c
@@ -1232,8 +1205,8 @@
- c -
- CMRminorPrint() -: matroid.h -, matroid.c +: matroid.c +, matroid.h
- CMRminorType()
: matroid.h
@@ -1268,8 +1241,8 @@
- c -
- CMRraiseErrorMessage() -: env_internal.h -, env.c +: env.c +, env_internal.h
- CMRreallocBlockArray
: env.h
@@ -1278,96 +1251,88 @@
- c -
- - CMRregularityCloneSubtrees() -: seymour.h -, seymour.c -
- CMRregularityCompleteDecomposition() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityDecomposeSeriesParallel() -: regularity_internal.h -, regularity_series_parallel.c +: regularity_series_parallel.c +, seymour_internal.h
- CMRregularityDecomposeThreeSum() -: regularity_threesum.c -, regularity_internal.h +: seymour_internal.h +, regularity_threesum.c
- CMRregularityExtendNestedMinorSequence() -: regularity_internal.h -, regularity_nested_minor_sequence.c +: regularity_nested_minor_sequence.c +, seymour_internal.h
- CMRregularityInitNestedMinorSequence() -: regularity_internal.h -, regularity_nested_minor_sequence.c +: regularity_nested_minor_sequence.c +, seymour_internal.h
- CMRregularityNestedMinorSequenceCographicness() : regularity_graphic.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityNestedMinorSequenceGraphicness() : regularity_graphic.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityNestedMinorSequenceSearchThreeSeparation() -: regularity_internal.h -, regularity_partition.c +: regularity_partition.c +, seymour_internal.h
- CMRregularityQueueAdd() -: regularity_internal.h -, regularity.c +: seymour.c +, seymour_internal.h
- CMRregularityQueueCreate() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityQueueEmpty() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityQueueFree() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityQueueRemove() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityRefineDecomposition() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularitySearchOneSum() : regularity_onesum.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityTaskCreateRoot() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityTaskFree() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityTaskRun() -: regularity.c - -
- CMRregularityTest() -: regularity.c -, regularity_internal.h +: seymour.c
- CMRregularityTestCographicness() : regularity_graphic.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityTestGraphicness() : regularity_graphic.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityTestR10() : regularity_r10.c -, regularity_internal.h +, seymour_internal.h
- CMRregularParamsInit()
: regular.h
@@ -1378,7 +1343,7 @@
- c -
- CMRregularSequenceGraphic() -: regularity_graphic.c +: regularity_graphic.c
- CMRregularStatsInit()
: regular.h
@@ -1389,8 +1354,8 @@
- c -
- CMRregularTest() -: regular.c -, regular.h +: regular.h +, regular.c
- CMRrowToElement()
: element.h
@@ -1416,8 +1381,8 @@
- c -
- CMRsepaFindBinaryRepresentativesSubmatrix() -: separation.h -, separation.c +: separation.c +, separation.h
- CMRsepaFree()
: separation.h
@@ -1440,8 +1405,8 @@
- c -
- CMRseymourChild() -: seymour.h -, seymour.c +: seymour.c +, seymour.h
- CMRseymourChildColumnsToParent()
: seymour.h
@@ -1451,6 +1416,10 @@
- c -
+ - CMRseymourCloneSubtrees() +: seymour.h +, seymour.c +
- CMRseymourCloneUnknown()
: seymour.h
, seymour.c
@@ -1472,8 +1441,8 @@
- c -
- CMRseymourCographicness() -: seymour.c -, seymour.h +: seymour.h +, seymour.c
- CMRseymourCographSizeCoforest()
: seymour.h
@@ -1494,21 +1463,29 @@
- c -
+ - CMRseymourDecompose() +: seymour.c +, seymour_internal.h +
- CMRseymourGetMatrix() -: seymour.c -, seymour.h +: seymour.h +, seymour.c
- CMRseymourGetTranspose() : seymour.h , seymour.c +
- CMRseymourGetUsed() +: seymour.h +, seymour.c +
- CMRseymourGraph() : seymour.h , seymour.c
- CMRseymourGraphArcsReversed() -: seymour.h -, seymour.c +: seymour.c +, seymour.h
- CMRseymourGraphCoforest()
: seymour.h
@@ -1519,8 +1496,8 @@
- c -
- CMRseymourGraphicness() -: seymour.c -, seymour.h +: seymour.h +, seymour.c
- CMRseymourGraphSizeCoforest()
: seymour.h
@@ -1531,8 +1508,8 @@
- c -
- CMRseymourHasTranspose() -: seymour.h -, seymour.c +: seymour.c +, seymour.h
- CMRseymourIsTernary()
: seymour.h
@@ -1562,6 +1539,10 @@
- c -
+ - CMRseymourParamsInit() +: seymour.h +, seymour.c +
- CMRseymourPivotColumns()
: seymour.h
, seymour.c
@@ -1591,8 +1572,16 @@
- c -
- CMRseymourSetNumChildren() -: seymour_internal.h -, seymour.c +: seymour.c +, seymour_internal.h + +
- CMRseymourStatsInit() +: seymour.h +, seymour.c + +
- CMRseymourStatsPrint() +: seymour.c +, seymour.h
- CMRseymourThreeSumConcentratedRank()
: seymour.h
@@ -1767,8 +1756,8 @@
- c -
-
, tu.c
- CMRtuTest() -: tu.h -, tu.c +: tu.h +, tu.c
- CMRtwoSum()
: separation.h
diff --git a/globals_d.html b/globals_d.html
index 1a4504f6..aadf27b4 100644
--- a/globals_d.html
+++ b/globals_d.html
@@ -124,10 +124,10 @@
- d -
- DecompositionQueue -: regularity_internal.h +: seymour_internal.h
- DecompositionTask -: regularity_internal.h +: seymour_internal.h
- decToGraph() : graphic.c diff --git a/globals_defs.html b/globals_defs.html index 39c9e74d..3564266e 100644 --- a/globals_defs.html +++ b/globals_defs.html @@ -76,6 +76,9 @@
- CMR_CALL : env.h +
- CMR_DEBUG +: tu.c +
- CMR_UNUSED : env.h diff --git a/globals_enum.html b/globals_enum.html index 3aeb1a69..cabf79e6 100644 --- a/globals_enum.html +++ b/globals_enum.html @@ -76,30 +76,24 @@
- CMR_BALANCED_ALGORITHM : balanced.h -
- CMR_DEC_CONSTRUCT -: regular.h -
- CMR_ERROR : env.h
- CMR_MINOR_TYPE : matroid.h -
- CMR_REGULAR_TREE_FLAGS -: regular.h -
- CMR_SEPA_FLAGS : separation.h
- CMR_SEPA_TYPE : separation.h -
- CMR_SEYMOUR_NODE_THREESUM_FLAG -: seymour.h -
- CMR_SEYMOUR_NODE_TYPE : seymour.h +
- CMR_SEYMOUR_THREESUM_FLAG +: seymour.h +
- CMR_TU_ALGORITHM : tu.h diff --git a/globals_eval.html b/globals_eval.html index 69be0dcf..997a6973 100644 --- a/globals_eval.html +++ b/globals_eval.html @@ -96,15 +96,6 @@
- CMR_BALANCED_ALGORITHM_SUBMATRIX : balanced.h -
- CMR_DEC_CONSTRUCT_ALL -: regular.h - -
- CMR_DEC_CONSTRUCT_LEAVES -: regular.h - -
- CMR_DEC_CONSTRUCT_NONE -: regular.h -
- CMR_ERROR_INPUT : env.h @@ -129,6 +120,9 @@
- CMR_MINOR_TYPE_DETERMINANT : matroid.h +
- CMR_MINOR_TYPE_ENTRY +: matroid.h +
- CMR_MINOR_TYPE_FANO : matroid.h @@ -153,24 +147,6 @@
- CMR_OKAY : env.h -
- CMR_REGULAR_TREE_FLAGS_DEFAULT -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_RECURSE -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_STOP_IRREGULAR -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_STOP_NONCOGRAPHIC -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_STOP_NONGRAPHIC -: regular.h - -
- CMR_REGULAR_TREE_FLAGS_STOP_NONGRAPHIC_NONCOGRAPHIC -: regular.h -
- CMR_SEPA_FIRST : separation.h @@ -198,45 +174,6 @@
- CMR_SEPA_TYPE_TWO : separation.h -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_CONCENTRATED_RANK -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_DISTRIBUTED_RANKS -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_ALLREPR -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_MIXED -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_TALL -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_WIDE -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_NO_PIVOTS -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_ALLREPR -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_MIXED -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_TALL -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_WIDE -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_SEYMOUR -: seymour.h - -
- CMR_SEYMOUR_NODE_THREESUM_FLAG_TRUEMPER -: seymour.h -
- CMR_SEYMOUR_NODE_TYPE_COGRAPH : seymour.h @@ -270,6 +207,45 @@
- CMR_SEYMOUR_NODE_TYPE_UNKNOWN : seymour.h +
- CMR_SEYMOUR_THREESUM_FLAG_CONCENTRATED_RANK +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_DISTRIBUTED_RANKS +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_ALLREPR +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_MIXED +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_TALL +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_WIDE +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_NO_PIVOTS +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_ALLREPR +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_MIXED +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_TALL +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_WIDE +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_SEYMOUR +: seymour.h + +
- CMR_SEYMOUR_THREESUM_FLAG_TRUEMPER +: seymour.h +
- CMR_TU_ALGORITHM_DECOMPOSITION : tu.h diff --git a/globals_func_c.html b/globals_func_c.html index aa03376a..7dcf2209 100644 --- a/globals_func_c.html +++ b/globals_func_c.html @@ -262,8 +262,8 @@
- c -
- c -
- c -
- c -
- c -
- c -
-
, ctu.c
- CMRcomputeRepresentationMatrix() -: graphic.c -, graphic_internal.h +: graphic_internal.h +, graphic.c
- CMRconsistencyMessage()
: env.c
@@ -351,8 +351,8 @@
- c -
-
, matrix.c
- CMRdblmatIsTernary() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRdblmatPermute()
: matrix.h
@@ -426,8 +426,8 @@
- c -
- CMRdensebinmatrixCreate() -: densematrix.c -, densematrix.h +: densematrix.h +, densematrix.c
- CMRdensebinmatrixFlip()
: densematrix.h
@@ -491,8 +491,8 @@
- c -
- CMRfreeEnvironment() -: env.h -, env.c +: env.c +, env.h
- CMRgetDecRankLowerLeft()
: regular_dec.c
@@ -505,8 +505,8 @@
- c -
-
, env.c
- CMRgetStackUsage() -: env_internal.h -, env.c +: env.c +, env_internal.h
- CMRgraphAddEdge()
: graph.h
@@ -525,16 +525,16 @@
- c -
-
, graph.c
- CMRgraphCreateEmpty() -: graph.c -, graph.h +: graph.h +, graph.c
- CMRgraphCreateFromEdgeList() : graph.h , graph.c
- CMRgraphDeleteEdge() -: graph.h -, graph.c +: graph.c +, graph.h
- CMRgraphDeleteNode()
: graph.h
@@ -562,12 +562,12 @@
- c -
-
: graph.c
- CMRgraphFree() -: graph.h -, graph.c +: graph.c +, graph.h
- CMRgraphicComputeMatrix() -: graphic.h -, graphic.c +: graphic.c +, graphic.h
- CMRgraphicStatsInit()
: graphic.h
@@ -585,8 +585,8 @@
- c -
- CMRgraphicTestTranspose() -: graphic.h -, graphic.c +: graphic.c +, graphic.h
- CMRgraphIncEdge()
: graph.h
@@ -632,8 +632,8 @@
- c -
-
: graph.h
- CMRgraphPrint() -: graph.c -, graph.h +: graph.h +, graph.c
- CMRintheapClearStack()
: heap.c
@@ -664,12 +664,12 @@
- c -
-
: heap.h
- CMRintheapInitStack() -: heap.c -, heap.h +: heap.h +, heap.c
- CMRintheapInsert() -: heap.c -, heap.h +: heap.h +, heap.c
- CMRintheapMinimumKey()
: heap.h
@@ -686,12 +686,12 @@
- c -
-
, matrix.c
- CMRintmatCheckTranspose() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRintmatComputeUpperDiagonal() -: linear_algebra.c -, linear_algebra_internal.h +: linear_algebra_internal.h +, linear_algebra.c
- CMRintmatConsistency()
: matrix.h
@@ -726,12 +726,12 @@
- c -
- CMRintmatFindEntry() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRintmatFree() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRintmatIsBinary()
: matrix.h
@@ -750,8 +750,8 @@
- c -
-
, matrix.c
- CMRintmatPrintSparse() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRintmatSignedSupport()
: matrix.h
@@ -770,12 +770,12 @@
- c -
-
, matrix.c
- CMRintmatTranspose() -: matrix.c -, matrix.h +: matrix.h +, matrix.c
- CMRintmatZoomSubmat() -: matrix.h -, matrix.c +: matrix.c +, matrix.h
- CMRlinearhashtableArrayCreate()
: hashtable.c
@@ -794,8 +794,8 @@
- c -
- CMRlinearhashtableArrayInsertBucketHash() -: hashtable.c -, hashtable.h +: hashtable.h +, hashtable.c
- CMRlinearhashtableArrayKey()
: hashtable.c
@@ -810,8 +810,8 @@
- c -
- CMRlisthashtableFindFirst() -: hashtable.h -, hashtable.c +: hashtable.c +, hashtable.h
- CMRlisthashtableFindNext()
: hashtable.c
@@ -874,16 +874,16 @@
- c -
- CMRlistmat64Insert() -: listmatrix.c -, listmatrix.h +: listmatrix.h +, listmatrix.c
- CMRlistmat64PrintDense() : listmatrix.c , listmatrix.h
- CMRlistmat8Alloc() -: listmatrix.h -, listmatrix.c +: listmatrix.c +, listmatrix.h
- CMRlistmat8Delete()
: listmatrix.c
@@ -916,16 +916,16 @@
- c -
- CMRlistmat8Insert() -: listmatrix.c -, listmatrix.h +: listmatrix.h +, listmatrix.c
- CMRlistmat8PrintDense() : listmatrix.c , listmatrix.h
- CMRminorCreate() -: matroid.c -, matroid.h +: matroid.h +, matroid.c
- CMRminorFree()
: matroid.h
@@ -948,8 +948,8 @@
- c -
- CMRnetworkStatsInit() -: network.c -, network.h +: network.h +, network.c
- CMRnetworkStatsPrint()
: network.h
@@ -960,8 +960,8 @@
- c -
- CMRnetworkTestTranspose() -: network.h -, network.c +: network.c +, network.h
- CMRoneSum()
: separation.h
@@ -975,96 +975,88 @@
- c -
- - CMRregularityCloneSubtrees() -: seymour.h -, seymour.c -
- CMRregularityCompleteDecomposition() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityDecomposeSeriesParallel() -: regularity_internal.h -, regularity_series_parallel.c +: regularity_series_parallel.c +, seymour_internal.h
- CMRregularityDecomposeThreeSum() : regularity_threesum.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityExtendNestedMinorSequence() -: regularity_internal.h -, regularity_nested_minor_sequence.c +: regularity_nested_minor_sequence.c +, seymour_internal.h
- CMRregularityInitNestedMinorSequence() -: regularity_internal.h -, regularity_nested_minor_sequence.c +: regularity_nested_minor_sequence.c +, seymour_internal.h
- CMRregularityNestedMinorSequenceCographicness() : regularity_graphic.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityNestedMinorSequenceGraphicness() -: regularity_graphic.c -, regularity_internal.h +: seymour_internal.h +, regularity_graphic.c
- CMRregularityNestedMinorSequenceSearchThreeSeparation() : regularity_partition.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityQueueAdd() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityQueueCreate() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityQueueEmpty() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityQueueFree() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityQueueRemove() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityRefineDecomposition() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularitySearchOneSum() -: regularity_internal.h -, regularity_onesum.c +: regularity_onesum.c +, seymour_internal.h
- CMRregularityTaskCreateRoot() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityTaskFree() -: regularity.c -, regularity_internal.h +: seymour.c +, seymour_internal.h
- CMRregularityTaskRun() -: regularity.c - -
- CMRregularityTest() -: regularity.c -, regularity_internal.h +: seymour.c
- CMRregularityTestCographicness() -: regularity_graphic.c -, regularity_internal.h +: seymour_internal.h +, regularity_graphic.c
- CMRregularityTestGraphicness() : regularity_graphic.c -, regularity_internal.h +, seymour_internal.h
- CMRregularityTestR10() -: regularity_internal.h -, regularity_r10.c +: regularity_r10.c +, seymour_internal.h
- CMRregularParamsInit()
: regular.h
@@ -1075,19 +1067,19 @@
- c -
- CMRregularSequenceGraphic() -: regularity_graphic.c +: regularity_graphic.c
- CMRregularStatsInit() -: regular.h -, regular.c +: regular.c +, regular.h
- CMRregularStatsPrint() : regular.h , regular.c
- CMRregularTest() -: regular.h -, regular.c +: regular.h +, regular.c
- CMRrowToElement()
: element.h
@@ -1117,12 +1109,12 @@
- c -
- CMRsepaFree() -: separation.h -, separation.c +: separation.c +, separation.h
- CMRsepaGetProjection() -: separation.c -, separation.h +: separation.h +, separation.c
- CMRsepaGetRepresentatives()
: separation.h
@@ -1141,13 +1133,17 @@
- c -
- CMRseymourChildColumnsToParent() -: seymour.h -, seymour.c +: seymour.c +, seymour.h
- CMRseymourChildRowsToParent() : seymour.h , seymour.c +
- CMRseymourCloneSubtrees() +: seymour.h +, seymour.c +
- CMRseymourCloneUnknown()
: seymour.h
, seymour.c
@@ -1161,8 +1157,8 @@
- c -
- CMRseymourCographCoforest() -: seymour.c -, seymour.h +: seymour.h +, seymour.c
- CMRseymourCographForest()
: seymour.h
@@ -1177,8 +1173,8 @@
- c -
- CMRseymourCographSizeForest() -: seymour.h -, seymour.c +: seymour.c +, seymour.h
- CMRseymourConsistency()
: seymour_internal.h
@@ -1191,6 +1187,10 @@
- c -
+ - CMRseymourDecompose() +: seymour.c +, seymour_internal.h +
- CMRseymourGetMatrix()
: seymour.h
, seymour.c
@@ -1199,6 +1199,10 @@
- c -
+ - CMRseymourGetUsed() +: seymour.h +, seymour.c +
- CMRseymourGraph()
: seymour.h
, seymour.c
@@ -1224,16 +1228,16 @@
- c -
- CMRseymourGraphSizeForest() -: seymour.h -, seymour.c +: seymour.c +, seymour.h
- CMRseymourHasTranspose() : seymour.h , seymour.c
- CMRseymourIsTernary() -: seymour.c -, seymour.h +: seymour.h +, seymour.c
- CMRseymourMinor()
: seymour.h
@@ -1252,16 +1256,20 @@
- c -
- CMRseymourNumPivots() -: seymour.c -, seymour.h +: seymour.h +, seymour.c
- CMRseymourNumRows() : seymour.h , seymour.c +
- CMRseymourParamsInit() +: seymour.h +, seymour.c +
- CMRseymourPivotColumns() -: seymour.h -, seymour.c +: seymour.c +, seymour.h
- CMRseymourPivotRows()
: seymour.h
@@ -1272,8 +1280,8 @@
- c -
- CMRseymourPrintChild() -: seymour_internal.h -, seymour.c +: seymour.c +, seymour_internal.h
- CMRseymourRegularity()
: seymour.h
@@ -1291,6 +1299,14 @@
- c -
+ - CMRseymourStatsInit() +: seymour.h +, seymour.c + +
- CMRseymourStatsPrint() +: seymour.h +, seymour.c +
- CMRseymourThreeSumConcentratedRank()
: seymour.h
, seymour.c
@@ -1389,8 +1405,8 @@
- c -
- CMRstatsComplementTotalUnimodularityInit() -: ctu.h -, ctu.c +: ctu.c +, ctu.h
- CMRstatsComplementTotalUnimodularityPrint()
: ctu.h
@@ -1452,8 +1468,8 @@
- c -
-
, tu.c
- CMRtuParamsInit() -: tu.c -, tu.h +: tu.h +, tu.c
- CMRtuStatsInit()
: tu.h
@@ -1464,8 +1480,8 @@
- c -
-
, tu.c
- CMRtuTest() -: tu.h -, tu.c +: tu.h +, tu.c
- CMRtwoSum() : separation.h diff --git a/globals_type.html b/globals_type.html index f24ff1ff..d4c01f7c 100644 --- a/globals_type.html +++ b/globals_type.html @@ -128,10 +128,10 @@ : graphic.c
- DecompositionQueue -: regularity_internal.h +: seymour_internal.h
- DecompositionTask -: regularity_internal.h +: seymour_internal.h
- GRAPH_NODE
: block_decomposition.c
diff --git a/group__Matroid.html b/group__Matroid.html
index 71f0054a..3231b1d8 100644
--- a/group__Matroid.html
+++ b/group__Matroid.html
@@ -90,17 +90,18 @@
Enumerations
enum CMR_MINOR_TYPE {
- CMR_MINOR_TYPE_DETERMINANT = -1 + CMR_MINOR_TYPE_DETERMINANT = -2 +, CMR_MINOR_TYPE_ENTRY = -1 , CMR_MINOR_TYPE_CUSTOM = 0 , CMR_MINOR_TYPE_U24 = 1 -, CMR_MINOR_TYPE_FANO = 2 ,
- CMR_MINOR_TYPE_FANO_DUAL = 3 + CMR_MINOR_TYPE_FANO = 2 +, CMR_MINOR_TYPE_FANO_DUAL = 3 , CMR_MINOR_TYPE_K5 = 4 , CMR_MINOR_TYPE_K5_DUAL = 5 -, CMR_MINOR_TYPE_K33 = 6 ,
- CMR_MINOR_TYPE_K33_DUAL = 7 + CMR_MINOR_TYPE_K33 = 6 +, CMR_MINOR_TYPE_K33_DUAL = 7
}Enumerator CMR_MINOR_TYPE_DETERMINANT A submatrix \( M \) with \( |\det(M)| = 2 \).
CMR_MINOR_TYPE_ENTRY A submatrix \( M \) of size 1-by-1 exhibiting a bad entry.
+CMR_MINOR_TYPE_CUSTOM A custom minor.
CMR_MINOR_TYPE_U24 A minor representing \( U^2_4 \).
diff --git a/group__Seymour.html b/group__Seymour.html index ab2a9a27..2e1fe749 100644 --- a/group__Seymour.html +++ b/group__Seymour.html @@ -73,6 +73,7 @@@@ -81,6 +82,15 @@+
+Classes
struct CMR_SEYMOUR_PARAMS Parameters for Seymour decomposition algorithm. More... struct CMR_SEYMOUR_STATS Statistics for Seymour decomposition algorithm. More... Typedefs
typedef struct _CMR_SEYMOUR_NODE CMR_SEYMOUR_NODE Functions
CMR_EXPORT CMR_ERROR CMRseymourParamsInit (CMR_SEYMOUR_PARAMS *params) Initializes the default parameters for regularity testing. More... CMR_EXPORT CMR_ERROR CMRseymourStatsInit (CMR_SEYMOUR_STATS *stats) Initializes all statistics for Seymour decomposition computations. More... CMR_EXPORT CMR_ERROR CMRseymourStatsPrint (FILE *stream, CMR_SEYMOUR_STATS *stats, const char *prefix) Prints statistics for Seymour decomposition computations. More... CMR_EXPORT bool CMRseymourIsTernary (CMR_SEYMOUR_NODE *node) Returns trueiff the decomposition is over \( \mathbb{F}_3 \). More...CMR_EXPORT size_t * CMRseymourPivotColumns (CMR_SEYMOUR_NODE *node) Returns the array with the pivot columns (if available). More... CMR_EXPORT size_t CMRseymourGetUsed (CMR_SEYMOUR_NODE *node) Returns node's reference counter. More... CMR_EXPORT CMR_ERROR CMRseymourPrint (CMR *cmr, CMR_SEYMOUR_NODE *node, FILE *stream, bool printChildren, bool printParentElements, bool printMatrices, bool printGraphs, bool printReductions, bool printPivots) Prints the decomposition dectostream. More...CMR_EXPORT CMR_ERROR CMRseymourCloneUnknown (CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEYMOUR_NODE **pclone) Clones a decomposition node decinto*pclonewhich represents the same matrix but has type CMR_SEYMOUR_NODE_TYPE_UNKNOWN type. More...CMR_EXPORT CMR_ERROR CMRseymourCapture (CMR *cmr, CMR_SEYMOUR_NODE *node) Increases the reference counter by 1. More... CMR_EXPORT CMR_ERROR CMRseymourCreate (CMR *cmr, CMR_SEYMOUR_NODE **pnode, bool isTernary, CMR_CHRMAT *matrix) Creates an unknown decomposition node as a root. More... CMR_EXPORT CMR_ERROR CMRregularityCloneSubtrees (CMR *cmr, size_t numSubtrees, CMR_SEYMOUR_NODE **subtreeRoots, CMR_SEYMOUR_NODE **clonedSubtrees) Clones the union of subtrees, returning the copies. More... CMR_EXPORT CMR_ERROR CMRseymourCloneUnknown (CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEYMOUR_NODE **pclone) Clones a decomposition node nodeinto*pclonewhich represents the same matrix but has type CMR_SEYMOUR_NODE_TYPE_UNKNOWN type and no child nodes. More...CMR_EXPORT CMR_ERROR CMRseymourCloneSubtrees (CMR *cmr, size_t numSubtrees, CMR_SEYMOUR_NODE **subtreeRoots, CMR_SEYMOUR_NODE **clonedSubtrees) Clones the union of subtrees of a Seymour decomposition, returning the copies. More... Detailed Description
Typedef Documentation
@@ -264,133 +286,90 @@Enumeration Type Documentation
- -◆ CMR_SEYMOUR_NODE_THREESUM_FLAG
+ +◆ CMR_SEYMOUR_NODE_TYPE
- -- enum CMR_SEYMOUR_NODE_THREESUM_FLAG +enum CMR_SEYMOUR_NODE_TYPE - -Flags that indicate the type of \( 3 \)-separation.
-- See also
- The desired types can be set by modifying CMR_REGULAR_PARAMS::threeSumStrategy.
-
Enumerator CMR_SEYMOUR_NODE_THREESUM_FLAG_NO_PIVOTS Indicate to not change the rank distribution; only serves as an option; each constructed node will have either CMR_SEYMOUR_NODE_THREESUM_FLAG_DISTRIBUTED_RANKS or CMR_SEYMOUR_NODE_THREESUM_FLAG_CONCENTRATED_RANK set.
-CMR_SEYMOUR_NODE_THREESUM_FLAG_DISTRIBUTED_RANKS The two off-diagonal submatrices both have rank 1.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_CONCENTRATED_RANK The bottom-left submatrix has rank 2 and the top-right submatrix has rank 0.
- See also
- Decomposition of matroids.
Enumerator CMR_SEYMOUR_NODE_TYPE_IRREGULAR Node represents 3-connected irregular matrix.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_WIDE The first child node is of the form \( M_1^{\text{wide}} \); valid for distributed ranks.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_UNKNOWN Type of node is not yet determined.
CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_TALL The first child node is of the form \( M_1^{\text{tall}} \); valid for distributed ranks.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_ONE_SUM Node represents a \( 1 \)-sum of matrices; has at least 2 child nodes.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_MIXED The first child node is of the form \( M_1^{\text{mixed}} \); valid for concentrated rank.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_TWO_SUM Node represents a 2-sum of matrices; has two child nodes.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_ALLREPR The first child node is of the form \( M_1^{\text{all-repr}} \); valid for concentrated rank.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_THREE_SUM Node represents a 3-sum of matrices; has two child nodes.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_WIDE The second child node is of the form \( M_2^{\text{wide}} \); valid for distributed ranks.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_SERIES_PARALLEL Node represents a series-parallel reduction; has one child node.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_TALL The second child node is of the form \( M_2^{\text{tall}} \); valid for distributed ranks.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_PIVOTS Node represents an application of pivots; has one child node.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_MIXED The second child node is of the form \( M_2^{\text{mixed}} \); valid for concentrated rank.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_GRAPH Node represents a graphic or network leaf.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_ALLREPR The second child node is of the form \( M_2^{\text{all-repr}} \); valid for concentrated rank.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_COGRAPH Node represents a cographic or conetwork leaf.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_SEYMOUR This combination of flags indicates a \( 3 \)-sum as defined by Seymour.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_PLANAR Node represents a graphic and cographic (network and conetwork) leaf.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_THREESUM_FLAG_TRUEMPER This combination of flags indicates a \( 3 \)-sum as defined by Truemper.
- See also
- Decomposition of matroids.
CMR_SEYMOUR_NODE_TYPE_R10 Node represents a representation matrix of \( R_{10} \).
- See also
- Decomposition of matroids.
◆ CMR_SEYMOUR_NODE_TYPE
+ +◆ CMR_SEYMOUR_THREESUM_FLAG
- enum CMR_SEYMOUR_NODE_TYPE +enum CMR_SEYMOUR_THREESUM_FLAG + +Flags that indicate the type of \( 3 \)-separation.
+- See also
- The desired types can be set by modifying CMR_REGULAR_PARAMS.threeSumStrategy.
-
Enumerator CMR_SEYMOUR_NODE_TYPE_IRREGULAR Node represents 3-connected irregular matrix.
- See also
- seymour_decomposition.
Enumerator CMR_SEYMOUR_THREESUM_FLAG_NO_PIVOTS Indicate to not change the rank distribution; only serves as an option; each constructed node will have either CMR_SEYMOUR_THREESUM_FLAG_DISTRIBUTED_RANKS or CMR_SEYMOUR_THREESUM_FLAG_CONCENTRATED_RANK set.
CMR_SEYMOUR_NODE_TYPE_UNKNOWN Type of node is not yet determined.
+CMR_SEYMOUR_THREESUM_FLAG_DISTRIBUTED_RANKS The two off-diagonal submatrices both have rank 1.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_ONE_SUM Node represents a \( 1 \)-sum of matrices; has at least 2 child nodes.
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_CONCENTRATED_RANK The bottom-left submatrix has rank 2 and the top-right submatrix has rank 0.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_TWO_SUM Node represents a 2-sum of matrices; has two child nodes.
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_FIRST_WIDE The first child node is of the form \( M_1^{\text{wide}} \); valid for distributed ranks.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_THREE_SUM Node represents a 3-sum of matrices; has two child nodes.
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_FIRST_TALL The first child node is of the form \( M_1^{\text{tall}} \); valid for distributed ranks.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_SERIES_PARALLEL Node represents a series-parallel reduction; has one child node.
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_FIRST_MIXED The first child node is of the form \( M_1^{\text{mixed}} \); valid for concentrated rank.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_PIVOTS Node represents an application of pivots; has one child node.
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_FIRST_ALLREPR The first child node is of the form \( M_1^{\text{all-repr}} \); valid for concentrated rank.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_GRAPH Node represents a graphic or network leaf.
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_SECOND_WIDE The second child node is of the form \( M_2^{\text{wide}} \); valid for distributed ranks.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_COGRAPH Node represents a cographic or conetwork leaf.
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_SECOND_TALL The second child node is of the form \( M_2^{\text{tall}} \); valid for distributed ranks.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_PLANAR Node represents a graphic and cographic (network and conetwork) leaf.
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_SECOND_MIXED The second child node is of the form \( M_2^{\text{mixed}} \); valid for concentrated rank.
- See also
- matroid_decomposition.
CMR_SEYMOUR_NODE_TYPE_R10 Node represents a representation matrix of \( R_{10} \).
- See also
- seymour_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_SECOND_ALLREPR The second child node is of the form \( M_2^{\text{all-repr}} \); valid for concentrated rank.
- See also
- matroid_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_SEYMOUR This combination of flags indicates a \( 3 \)-sum as defined by Seymour.
- See also
- matroid_decomposition.
CMR_SEYMOUR_THREESUM_FLAG_TRUEMPER This combination of flags indicates a \( 3 \)-sum as defined by Truemper.
- See also
- matroid_decomposition.
Function Documentation
- -◆ CMRregularityCloneSubtrees()
- ----
-- -CMR_EXPORT CMR_ERROR CMRregularityCloneSubtrees -( -CMR * -cmr, -- -- - size_t -numSubtrees, -- -- - CMR_SEYMOUR_NODE ** -subtreeRoots, -- -- - CMR_SEYMOUR_NODE ** -clonedSubtrees -- -- ) -- - --Clones the union of subtrees, returning the copies.
-The set of decomposition nodes that are (grand-)children of any of the
- -numSubtreesnodessubtreeRootsis cloned. The respective clones are returned inclonedSubtrees.◆ CMRseymourCapture()
@@ -537,6 +516,49 @@+
◆ CMRseymourCloneSubtrees()
+ ++@@ -571,7 +593,7 @@++
++ +CMR_EXPORT CMR_ERROR CMRseymourCloneSubtrees +( +CMR * +cmr, ++ ++ + size_t +numSubtrees, ++ ++ + CMR_SEYMOUR_NODE ** +subtreeRoots, ++ ++ + CMR_SEYMOUR_NODE ** +clonedSubtrees ++ ++ ) ++ + +Clones the union of subtrees of a Seymour decomposition, returning the copies.
+The set of Seymour decomposition nodes that are (grand-)children of any of the
+numSubtreesnodessubtreeRootsis cloned. The respective clones are returned inclonedSubtrees.-
Clones a decomposition node
+decinto*pclonewhich represents the same matrix but has type CMR_SEYMOUR_NODE_TYPE_UNKNOWN type.Clones a decomposition node
nodeinto*pclonewhich represents the same matrix but has type CMR_SEYMOUR_NODE_TYPE_UNKNOWN type and no child nodes.- Parameters
-
cmr CMR environment. +
◆ CMRseymourGetUsed()
+ ++@@ -1270,6 +1318,33 @@++
++ +CMR_EXPORT size_t CMRseymourGetUsed +( +CMR_SEYMOUR_NODE * +node ) ++ + +Returns node's reference counter.
+- Parameters
-
+
+
+node Seymour decomposition node.
+
+
◆ CMRseymourParamsInit()
+ ++@@ -1473,6 +1548,76 @@++
++ +CMR_EXPORT CMR_ERROR CMRseymourParamsInit +( +CMR_SEYMOUR_PARAMS * +params ) ++ + +Initializes the default parameters for regularity testing.
+These are selected for minimum running time.
+- Parameters
-
+
+
+params Pointer to parameters.
+
+
◆ CMRseymourStatsInit()
+ +++ +++
++ +CMR_EXPORT CMR_ERROR CMRseymourStatsInit +( +CMR_SEYMOUR_STATS * +stats ) ++ + ++Initializes all statistics for Seymour decomposition computations.
+- Parameters
-
+
+
+stats Pointer to statistics.
+
◆ CMRseymourStatsPrint()
+ ++diff --git a/matroid_8h.html b/matroid_8h.html index e7dfb472..8de258f4 100644 --- a/matroid_8h.html +++ b/matroid_8h.html @@ -103,17 +103,18 @@++
++ +CMR_EXPORT CMR_ERROR CMRseymourStatsPrint +( +FILE * +stream, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ ++ + const char * +prefix ++ ++ ) ++ + +Prints statistics for Seymour decomposition computations.
+- Parameters
-
+
+
+stream File stream to print to. stats Pointer to statistics. prefix Prefix string to prepend to each printed line (may be NULL).
+
Enumerations
enum CMR_MINOR_TYPE {
- CMR_MINOR_TYPE_DETERMINANT = -1 + CMR_MINOR_TYPE_DETERMINANT = -2 +, CMR_MINOR_TYPE_ENTRY = -1 , CMR_MINOR_TYPE_CUSTOM = 0 , CMR_MINOR_TYPE_U24 = 1 -, CMR_MINOR_TYPE_FANO = 2 ,
- CMR_MINOR_TYPE_FANO_DUAL = 3 + CMR_MINOR_TYPE_FANO = 2 +, CMR_MINOR_TYPE_FANO_DUAL = 3 , CMR_MINOR_TYPE_K5 = 4 , CMR_MINOR_TYPE_K5_DUAL = 5 -, CMR_MINOR_TYPE_K33 = 6 ,
- CMR_MINOR_TYPE_K33_DUAL = 7 + CMR_MINOR_TYPE_K33 = 6 +, CMR_MINOR_TYPE_K33_DUAL = 7
}The matroid represented by a matrix \( M \in \mathbb{F}^{m \times n} \) has \( m + n \) elements that correspond to the columns of \( [ \mathbb{I} \mid M ] \). A subset of these columns is independent if and only if it is linearly independent over the field \( \mathbb{F} \).
-+
Decomposition of matroids
In CMR, the matroid represented by a matrix can be decomposed, which is essential for testing for total unimodularity and regularity. The internal representation is a decomposition tree whose nodes are references to CMR_MATROID_DEC.
Each such decomposition node belongs to a matrix, either of the ternary field \( \mathbb{F} = \mathbb{F}_3 \) or over the binary field \( \mathbb{F} = \mathbb{F}_2 \). This is indicated by CMRmatroiddecIsTernary. While each node has an explicit matrix (see CMRmatroiddecGetMatrix), its transpose need not be stored explicitly (see CMRmatroiddecHasTranspose and CMRmatroiddecGetTranspose). If the matroid is regular then the support matrix of such a ternary matrix is then also a binary representation matrix.
diff --git a/regular_8c.html b/regular_8c.html index b882f95f..15c7ad92 100644 --- a/regular_8c.html +++ b/regular_8c.html @@ -88,7 +88,6 @@#include <time.h>
#include "env_internal.h"
#include "seymour_internal.h"
-#include "regularity_internal.h"
Functions
CMR_ERROR CMRregularStatsPrint (FILE *stream, CMR_REGULAR_STATS *stats, const char *prefix) Prints statistics for regularity test computations. More... CMR_ERROR CMRregularTest (CMR *cmr, CMR_CHRMAT *matrix, bool *pisRegular, CMR_SEYMOUR_NODE **pdec, CMR_MINOR **pminor, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit) Tests binary linear matroid for regularity. More... CMR_ERROR CMRregularTest (CMR *cmr, CMR_CHRMAT *matrix, bool *pisRegular, CMR_SEYMOUR_NODE **proot, CMR_MINOR **pminor, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit) Tests binary linear matroid for regularity. More... CMR_ERROR CMRregularCompleteDecomposition (CMR *cmr, CMR_SEYMOUR_NODE *dec, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit) Completes a subtree of an existing decomposition tree. More... -
◆ CMRregularTest()
+ +◆ CMRregularTest()
@@ -362,7 +361,7 @@CMR_SEYMOUR_NODE ** -pdec, +proot, @@ -404,7 +403,7 @@ cmr
CMR environment. matrix Input matrix. pisRegular Pointer for storing whether matrixis regular.pdec Pointer for storing the decomposition tree (may be NULL).proot Pointer for storing the Seymour decomposition tree (may be NULL).pminor Pointer for storing an \( F_7 \) or \( F_7^\star \) minor. params Parameters for the computation (may be NULLfor defaults).stats Statistics for the computation (may be NULL).@@ -106,26 +105,6 @@regular.h File ReferenceStatistics for regular matroid recognition algorithm. More... -
-Enumerations
enum CMR_DEC_CONSTRUCT { CMR_DEC_CONSTRUCT_NONE = 0 -, CMR_DEC_CONSTRUCT_LEAVES = 1 -, CMR_DEC_CONSTRUCT_ALL = 2 - } enum CMR_REGULAR_TREE_FLAGS {
- CMR_REGULAR_TREE_FLAGS_RECURSE = 1 -, CMR_REGULAR_TREE_FLAGS_STOP_IRREGULAR = 2 -, CMR_REGULAR_TREE_FLAGS_STOP_NONGRAPHIC = 4 -, CMR_REGULAR_TREE_FLAGS_STOP_NONCOGRAPHIC = 8 -,
- CMR_REGULAR_TREE_FLAGS_STOP_NONGRAPHIC_NONCOGRAPHIC = 16 -, CMR_REGULAR_TREE_FLAGS_DEFAULT = CMR_REGULAR_TREE_FLAGS_RECURSE | CMR_REGULAR_TREE_FLAGS_STOP_IRREGULAR -
- }Flags that control termination of the regular matroid decomposition algorithm. More... Functions
CMR_EXPORT CMR_ERROR CMRregularParamsInit (CMR_REGULAR_PARAMS *params) CMR_EXPORT CMR_ERROR CMRregularStatsPrint (FILE *stream, CMR_REGULAR_STATS *stats, const char *prefix) Prints statistics for regularity test computations. More... CMR_EXPORT CMR_ERROR CMRregularTest (CMR *cmr, CMR_CHRMAT *matrix, bool *pisRegular, CMR_SEYMOUR_NODE **pdec, CMR_MINOR **pminor, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit) Tests binary linear matroid for regularity. More... CMR_EXPORT CMR_ERROR CMRregularTest (CMR *cmr, CMR_CHRMAT *matrix, bool *pisRegular, CMR_SEYMOUR_NODE **proot, CMR_MINOR **pminor, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit) Tests binary linear matroid for regularity. More... CMR_EXPORT CMR_ERROR CMRregularCompleteDecomposition (CMR *cmr, CMR_SEYMOUR_NODE *dec, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit) Completes a subtree of an existing decomposition tree. More... Detailed Description
Recognition of regular matrices.
-Enumeration Type Documentation
- -◆ CMR_DEC_CONSTRUCT
- --- ----
-- -enum CMR_DEC_CONSTRUCT -◆ CMR_REGULAR_TREE_FLAGS
- -----
-- -enum CMR_REGULAR_TREE_FLAGS -- --Flags that control termination of the regular matroid decomposition algorithm.
-- See also
- The desired types can be set by modifying CMR_REGULAR_PARAMS::treeFlags.
Function Documentation
+Function Documentation
◆ CMRregularCompleteDecomposition()
@@ -423,8 +352,8 @@-
◆ CMRregularTest()
+ +◆ CMRregularTest()
@@ -451,7 +380,7 @@CMR_SEYMOUR_NODE ** -pdec, +proot, @@ -493,7 +422,7 @@ cmr
CMR environment. matrix Input matrix. pisRegular Pointer for storing whether matrixis regular.pdec Pointer for storing the decomposition tree (may be NULL).proot Pointer for storing the Seymour decomposition tree (may be NULL).pminor Pointer for storing an \( F_7 \) or \( F_7^\star \) minor. params Parameters for the computation (may be NULLfor defaults).stats Statistics for the computation (may be NULL).51 CMR_REGULAR_TREE_FLAGS_DEFAULT = CMR_REGULAR_TREE_FLAGS_RECURSE | CMR_REGULAR_TREE_FLAGS_STOP_IRREGULAR- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +Basic functionality of the software library.@@ -204,55 +168,24 @@Functionality for graphs.Functionality for sparse matrices.Functionality for matroids.-Computation and recognition of network matrices and conetwork matrices.-CMR_EXPORT CMR_ERROR CMRregularCompleteDecomposition(CMR *cmr, CMR_SEYMOUR_NODE *dec, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit)Completes a subtree of an existing decomposition tree.Definition: regular.c:114-CMR_EXPORT CMR_ERROR CMRregularParamsInit(CMR_REGULAR_PARAMS *params)Initializes the default parameters for regularity testing.Definition: regular.c:13- -CMR_REGULAR_TREE_FLAGSFlags that control termination of the regular matroid decomposition algorithm.Definition: regular.h:39-@ CMR_REGULAR_TREE_FLAGS_STOP_NONGRAPHIC_NONCOGRAPHICDefinition: regular.h:48- -@ CMR_REGULAR_TREE_FLAGS_STOP_IRREGULARDefinition: regular.h:42-@ CMR_REGULAR_TREE_FLAGS_STOP_NONGRAPHICDefinition: regular.h:44-@ CMR_REGULAR_TREE_FLAGS_STOP_NONCOGRAPHICDefinition: regular.h:46-CMR_EXPORT CMR_ERROR CMRregularStatsPrint(FILE *stream, CMR_REGULAR_STATS *stats, const char *prefix)Prints statistics for regularity test computations.Definition: regular.c:51-CMR_EXPORT CMR_ERROR CMRregularRefineDecomposition(CMR *cmr, size_t numNodes, CMR_SEYMOUR_NODE **nodes, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit)Refines a list of decomposition nodes.Definition: regular.c:133-CMR_EXPORT CMR_ERROR CMRregularTest(CMR *cmr, CMR_CHRMAT *matrix, bool *pisRegular, CMR_SEYMOUR_NODE **pdec, CMR_MINOR **pminor, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit)Tests binary linear matroid for regularity.Definition: regular.c:86- - - - +CMR_EXPORT CMR_ERROR CMRregularStatsInit(CMR_REGULAR_STATS *stats)Initializes all statistics for regularity test computations.Definition: regular.c:30+CMR_EXPORT CMR_ERROR CMRregularCompleteDecomposition(CMR *cmr, CMR_SEYMOUR_NODE *dec, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit)Completes a subtree of an existing decomposition tree.Definition: regular.c:78+CMR_EXPORT CMR_ERROR CMRregularParamsInit(CMR_REGULAR_PARAMS *params)Initializes the default parameters for regularity testing.Definition: regular.c:12+CMR_EXPORT CMR_ERROR CMRregularStatsPrint(FILE *stream, CMR_REGULAR_STATS *stats, const char *prefix)Prints statistics for regularity test computations.Definition: regular.c:30+CMR_EXPORT CMR_ERROR CMRregularTest(CMR *cmr, CMR_CHRMAT *matrix, bool *pisRegular, CMR_SEYMOUR_NODE **proot, CMR_MINOR **pminor, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit)Tests binary linear matroid for regularity.Definition: regular.c:41+CMR_EXPORT CMR_ERROR CMRregularRefineDecomposition(CMR *cmr, size_t numNodes, CMR_SEYMOUR_NODE **nodes, CMR_REGULAR_PARAMS *params, CMR_REGULAR_STATS *stats, double timeLimit)Refines a list of decomposition nodes.Definition: regular.c:98CMR_EXPORT CMR_ERROR CMRregularStatsInit(CMR_REGULAR_STATS *stats)Initializes all statistics for regularity test computations.Definition: regular.c:21Recognition of series-parallel matrices.-Functionality for Seymour decomposition.- - -Definition: env_internal.h:45-Statistics for recognition algorithm for network matrices.Definition: network.h:36-Definition: regular.h:56-bool seriesParallelWhether to allow series-parallel operations in the decomposition tree; default: true.Definition: regular.h:59-CMR_DEC_CONSTRUCT graphsWhich (co)graphs to construct; default: CMR_DEC_CONSTRUCT_NONE.Definition: regular.h:102-bool planarityCheckWhether minors identified as graphic should still be checked for cographicness; default: false.Definition: regular.h:61-bool threeSumPivotChildrenWhether pivots for 3-sums shall be applied such that the matrix contains both child matrices as subma...Definition: regular.h:68-int treeFlagsFlags controlling the decomposition algorithm. SeeDefinition: regular.h:64-int threeSumStrategyWhether to perform pivots to change the rank distribution, and how to construct the children.Definition: regular.h:71- - - - - - - - - -bool directGraphicnessWhether to use fast graphicness routines; default: true.Definition: regular.h:57- - - - -uint32_t enumerationCandidatesCountDefinition: regular.h:135-Statistics for series-parallel recognition algorithm.Definition: series_parallel.h:25+ +Definition: seymour_internal.h:17+ + + + + +Definition: regular.h:26Definition: seymour_internal.h:16
diff --git a/regularity__graphic_8c.html b/regularity__graphic_8c.html index 53ef7191..2cadb173 100644 --- a/regularity__graphic_8c.html +++ b/regularity__graphic_8c.html @@ -82,9 +82,9 @@regularity_graphic.c File Reference-#include "regularity_internal.h"
-#include <cmr/graphic.h>
+#include <cmr/graphic.h>
#include <cmr/network.h>
+#include "seymour_internal.h"
#include "env_internal.h"
#include "hashtable.h"
#include <stdint.h>
@@ -141,8 +141,8 @@static CMR_ERROR createWheel (CMR *cmr, CMR_GRAPH *graph, CMR_CHRMAT *matrix, CMR_CHRMAT *transpose, size_t wheelSize, CMR_GRAPH_EDGE *rowEdges, CMR_GRAPH_EDGE *columnEdges) Creates the wheel graph for a wheel submatrix. More... CMR_ERROR CMRregularSequenceGraphic (CMR *cmr, CMR_CHRMAT *matrix, CMR_CHRMAT *transpose, size_t lengthSequence, size_t *sequenceNumRows, size_t *sequenceNumColumns, size_t *plastGraphicMinor, CMR_GRAPH **pgraph, CMR_ELEMENT **pedgeElements, CMR_REGULAR_STATS *stats, double timeLimit) CMR_ERROR CMRregularSequenceGraphic (CMR *cmr, CMR_CHRMAT *matrix, CMR_CHRMAT *transpose, size_t lengthSequence, size_t *sequenceNumRows, size_t *sequenceNumColumns, size_t *plastGraphicMinor, CMR_GRAPH **pgraph, CMR_ELEMENT **pedgeElements, CMR_SEYMOUR_STATS *stats, double timeLimit) static CMR_ERROR sequenceGraphicness (CMR *cmr, DecompositionTask *task, CMR_CHRMAT *matrix, CMR_CHRMAT *transpose, size_t length, size_t *sequenceNumRows, size_t *sequenceNumColumns, CMR_ELEMENT *rowsOriginal, CMR_ELEMENT *columnsOriginal, bool cographicness, CMR_GRAPH **pgraph, CMR_ELEMENT **pedgeElements, size_t *plastGraphicMinor) Tests each minor of the sequence of nested 3-connected minors for graphicness. More... -
◆ CMRregularSequenceGraphic()
+ +◆ CMRregularSequenceGraphic()
@@ -930,7 +930,7 @@- CMR_REGULAR_STATS * +CMR_SEYMOUR_STATS * stats, diff --git a/regularity__nested__minor__sequence_8c.html b/regularity__nested__minor__sequence_8c.html index 26a3f50f..285b30fb 100644 --- a/regularity__nested__minor__sequence_8c.html +++ b/regularity__nested__minor__sequence_8c.html @@ -84,7 +84,6 @@ #include "seymour_internal.h"
-#include "regularity_internal.h"
#include "env_internal.h"
#include "densematrix.h"
#include "hashtable.h"
diff --git a/regularity__onesum_8c.html b/regularity__onesum_8c.html index 2a939f10..eac21915 100644 --- a/regularity__onesum_8c.html +++ b/regularity__onesum_8c.html @@ -87,7 +87,6 @@#include <stdlib.h>
#include "env_internal.h"
#include "seymour_internal.h"
-#include "regularity_internal.h"
#include "sort.h"
#include "block_decomposition.h"
diff --git a/regularity__partition_8c.html b/regularity__partition_8c.html index 36c9c0dd..db7c228f 100644 --- a/regularity__partition_8c.html +++ b/regularity__partition_8c.html @@ -83,8 +83,7 @@
regularity_partition.c File Reference-#include "regularity_internal.h"
-#include "env_internal.h"
+diff --git a/regularity__r10_8c.html b/regularity__r10_8c.html index f6649218..46f9c66e 100644 --- a/regularity__r10_8c.html +++ b/regularity__r10_8c.html @@ -83,7 +83,6 @@
#include "env_internal.h"
-#include "regularity_internal.h"
#include "seymour_internal.h"
#include <float.h>
diff --git a/regularity__series__parallel_8c.html b/regularity__series__parallel_8c.html index b571ad15..002cf3c5 100644 --- a/regularity__series__parallel_8c.html +++ b/regularity__series__parallel_8c.html @@ -82,8 +82,7 @@
regularity_series_parallel.c File Reference-#include "regularity_internal.h"
-#include <cmr/series_parallel.h>
+#include <cmr/series_parallel.h>
#include "env_internal.h"
#include "seymour_internal.h"
#include <time.h>
diff --git a/regularity__threesum_8c.html b/regularity__threesum_8c.html index 1c7b6204..7ab0485e 100644 --- a/regularity__threesum_8c.html +++ b/regularity__threesum_8c.html @@ -89,7 +89,6 @@#include <stdlib.h>
#include "env_internal.h"
#include "seymour_internal.h"
-#include "regularity_internal.h"
Classes
#include "listmatrix.h"
#include <assert.h>
#include <string.h>
+#include <time.h>
Classes
struct ClonePair Pair of a given Seymour decomposition node and its clone. More... @@ -104,6 +106,15 @@
Functions
CMR_ERROR CMRseymourParamsInit (CMR_SEYMOUR_PARAMS *params) Initializes the default parameters for regularity testing. More... CMR_ERROR CMRseymourStatsInit (CMR_SEYMOUR_STATS *stats) Initializes all statistics for Seymour decomposition computations. More... CMR_ERROR CMRseymourStatsPrint (FILE *stream, CMR_SEYMOUR_STATS *stats, const char *prefix) Prints statistics for Seymour decomposition computations. More... bool CMRseymourIsTernary (CMR_SEYMOUR_NODE *node) Returns trueiff the decomposition is over \( \mathbb{F}_3 \). More...size_t * CMRseymourPivotColumns (CMR_SEYMOUR_NODE *node) Returns the array with the pivot columns (if available). More... size_t CMRseymourGetUsed (CMR_SEYMOUR_NODE *node) Returns node's reference counter. More... CMR_ERROR CMRseymourPrintChild (CMR *cmr, CMR_SEYMOUR_NODE *child, CMR_SEYMOUR_NODE *parent, size_t childIndex, FILE *stream, size_t indent, bool printChildren, bool printParentElements, bool printMatrices, bool printGraphs, bool printReductions, bool printPivots) Prints the decomposition childtostream. More...static CMR_ERROR createNode (CMR *cmr, CMR_SEYMOUR_NODE **pnode, bool isTernary, CMR_SEYMOUR_NODE_TYPE type, size_t numRows, size_t numColumns) CMR_ERROR CMRseymourCloneUnknown (CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEYMOUR_NODE **pclone) Clones a decomposition node decinto*pclonewhich represents the same matrix but has type CMR_SEYMOUR_NODE_TYPE_UNKNOWN type. More...Clones a decomposition node nodeinto*pclonewhich represents the same matrix but has type CMR_SEYMOUR_NODE_TYPE_UNKNOWN type and no child nodes. More...static CMR_ERROR updateRowsColumnsToParent (CMR *cmr, CMR_SEYMOUR_NODE *parent, size_t childIndex, size_t *parentRows, size_t *parentColumns) Allocates and sets childRowsToParent and childColumnsToParent of the child of parentindicated bychildIndex. More...Set regularity and (co)graphicness attributes of a decomposition tree. More... static CMR_ERROR cloneRecursively (CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEYMOUR_NODE **pclone, CMR_LISTHASHTABLE *nodesToClonesHashtable, ClonePair **pclonePairs, size_t *pmemClonePairs, size_t *pnumClonePairs) Clones nodeto*pclone, updates cloning data structures and calls itself recursively. More...CMR_ERROR CMRregularityCloneSubtrees (CMR *cmr, size_t numSubtrees, CMR_SEYMOUR_NODE **subtreeRoots, CMR_SEYMOUR_NODE **clonedSubtrees) Clones the union of subtrees, returning the copies. More... CMR_ERROR CMRseymourCloneSubtrees (CMR *cmr, size_t numSubtrees, CMR_SEYMOUR_NODE **subtreeRoots, CMR_SEYMOUR_NODE **clonedSubtrees) Clones the union of subtrees of a Seymour decomposition, returning the copies. More... CMR_ERROR CMRregularityTaskCreateRoot (CMR *cmr, CMR_SEYMOUR_NODE *dec, DecompositionTask **ptask, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, clock_t startClock, double timeLimit) Creates a decomposition task for the root of the decomposition. More... CMR_ERROR CMRregularityTaskFree (CMR *cmr, DecompositionTask **ptask) Frees a decomposition task. More... CMR_ERROR CMRregularityQueueCreate (CMR *cmr, DecompositionQueue **pqueue) Initializes a decomposition queue. More... CMR_ERROR CMRregularityQueueFree (CMR *cmr, DecompositionQueue **pqueue) Frees the decomposition queue. More... bool CMRregularityQueueEmpty (DecompositionQueue *queue) Returns whether a queue is empty. More... DecompositionTask * CMRregularityQueueRemove (DecompositionQueue *queue) Removes a task from a decomposition queue. More... void CMRregularityQueueAdd (DecompositionQueue *queue, DecompositionTask *task) Adds a task to a decomposition queue. More... static CMR_ERROR CMRregularityTaskRun (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Runs a task for processing the associated decomposition node. More... CMR_ERROR CMRseymourDecompose (CMR *cmr, CMR_CHRMAT *matrix, bool ternary, CMR_SEYMOUR_NODE **proot, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit) Tests ternary or binary linear matroid for regularity. More... CMR_ERROR CMRregularityCompleteDecomposition (CMR *cmr, CMR_SEYMOUR_NODE *subtree, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit) Replaces the subtree of a matroid decomposition tree by a new one. More... CMR_ERROR CMRregularityRefineDecomposition (CMR *cmr, size_t numNodes, CMR_SEYMOUR_NODE **nodes, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit) Replaces the subtrees of several nodes of a matroid decomposition tree by new ones. More... Macro Definition Documentation
@@ -383,6 +431,9 @@+ +
Clones
+nodeto*pclone, updates cloning data structures and calls itself recursively.Inserts it into
nodesToClonesHashtable, and updates the array*pclonePairswith the cloned pairs.- Parameters
-
cmr CMR environment. +
◆ CMRregularityCompleteDecomposition()
+ +++ +++
++ +CMR_ERROR CMRregularityCompleteDecomposition +( +CMR * +cmr, ++ ++ + CMR_SEYMOUR_NODE * +subtree, ++ ++ + CMR_SEYMOUR_PARAMS * +params, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ ++ + double +timeLimit ++ ++ ) ++ + ++Replaces the subtree of a matroid decomposition tree by a new one.
+- Parameters
-
+
+
+cmr CMR environment. subtree Decomposition node of the subtree root. params Parameters for the computation. stats Statistics for the computation (may be NULL).timeLimit Time limit to impose.
+
◆ CMRregularityQueueAdd()
+ +++ +++
++ +void CMRregularityQueueAdd +( +DecompositionQueue * +queue, ++ ++ + DecompositionTask * +task ++ ++ ) ++ + ++Adds a task to a decomposition queue.
+- Parameters
-
+
+
+queue Queue. task Task.
+
◆ CMRregularityQueueCreate()
+ +++ +++
++ +CMR_ERROR CMRregularityQueueCreate +( +CMR * +cmr, ++ ++ + DecompositionQueue ** +pqueue ++ ++ ) ++ + ++Initializes a decomposition queue.
+- Parameters
-
+
+
+cmr CMR environment. pqueue Pointer for storing the queue.
+
◆ CMRregularityQueueEmpty()
+ +++ +++
++ +bool CMRregularityQueueEmpty +( +DecompositionQueue * +queue ) ++ + ++Returns whether a queue is empty.
+- Parameters
-
+
+
+queue Queue.
+
◆ CMRregularityQueueFree()
+ +++ +++
++ +CMR_ERROR CMRregularityQueueFree +( +CMR * +cmr, ++ ++ + DecompositionQueue ** +pqueue ++ ++ ) ++ + ++Frees the decomposition queue.
+- Parameters
-
+
+
+cmr CMR environment. pqueue Pointer to queue.
+
◆ CMRregularityQueueRemove()
+ +++ +++
++ +DecompositionTask* CMRregularityQueueRemove +( +DecompositionQueue * +queue ) ++ + ++Removes a task from a decomposition queue.
+- Parameters
-
+
+
+queue Queue.
+
◆ CMRregularityRefineDecomposition()
+ +++ +++
++ +CMR_ERROR CMRregularityRefineDecomposition +( +CMR * +cmr, ++ ++ + size_t +numNodes, ++ ++ + CMR_SEYMOUR_NODE ** +nodes, ++ ++ + CMR_SEYMOUR_PARAMS * +params, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ ++ + double +timeLimit ++ ++ ) ++ + ++Replaces the subtrees of several nodes of a matroid decomposition tree by new ones.
+- Parameters
-
+
+
+cmr CMR environment. numNodes Number of nodes to refine. nodes Array of decomposition nodes to refine. params Parameters for the computation. stats Statistics for the computation (may be NULL).timeLimit Time limit to impose.
+
◆ CMRregularityTaskCreateRoot()
+ +++ +++
++ +CMR_ERROR CMRregularityTaskCreateRoot +( +CMR * +cmr, ++ ++ + CMR_SEYMOUR_NODE * +dec, ++ ++ + DecompositionTask ** +ptask, ++ ++ + CMR_SEYMOUR_PARAMS * +params, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ ++ + clock_t +startClock, ++ ++ + double +timeLimit ++ ++ ) ++ + ++Creates a decomposition task for the root of the decomposition.
+- Parameters
-
+
+
+cmr CMR environment. dec Decomposition node. ptask Pointer for storing the new task. params Parameters for the computation. stats Statistics for the computation (may be NULL).startClock Clock for the start time. timeLimit Time limit to impose.
+
◆ CMRregularityTaskFree()
+ +++ +++
++ +CMR_ERROR CMRregularityTaskFree +( +CMR * +cmr, ++ ++ + DecompositionTask ** +ptask ++ ++ ) ++ + ++Frees a decomposition task.
+- Parameters
-
+
+
+cmr CMR environment. ptask Pointer to task.
+
◆ CMRregularityTaskRun()
+ ++@@ -514,6 +1012,80 @@++
++ ++ ++
++ +static CMR_ERROR CMRregularityTaskRun +( +CMR * +cmr, ++ ++ + DecompositionTask * +task, ++ ++ + DecompositionQueue * +queue ++ ++ ) ++ +static ++ +Runs a task for processing the associated decomposition node.
+- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed tasks.
+
+
◆ CMRseymourDecompose()
+ ++diff --git a/seymour_8h.html b/seymour_8h.html index 516369d4..f41cdc61 100644 --- a/seymour_8h.html +++ b/seymour_8h.html @@ -77,6 +77,7 @@++
++ +CMR_ERROR CMRseymourDecompose +( +CMR * +cmr, ++ ++ + CMR_CHRMAT * +matrix, ++ ++ + bool +ternary, ++ ++ + CMR_SEYMOUR_NODE ** +proot, ++ ++ + CMR_SEYMOUR_PARAMS * +params, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ ++ + double +timeLimit ++ ++ ) ++ + +Tests ternary or binary linear matroid for regularity.
+If
+pdecis notNULL,*pdecwill be a (partial) decomposition tree.If
+pminoris notNULLandmatrixis not regular, then an \( F_7 \) or \( F_7^\star \) minor or a submatrix with non-ternary determinant is searched. This causes additional computational effort!- Parameters
-
+
+
+cmr CMR environment. matrix Input matrix. ternary Whether the matrix shall be considered ternary. proot Pointer for storing the root of the Seymour decomposition. params Parameters for the computation. stats Statistics for the computation (may be NULL).timeLimit Time limit to impose.
+
@@ -91,10 +92,22 @@#include <cmr/matrix.h>
#include <cmr/matroid.h>
#include <cmr/graph.h>
+#include <cmr/network.h>
+#include <cmr/series_parallel.h>
#include <stdio.h>
+#include <stdint.h>
Go to the source code of this file.
+
+Classes
struct CMR_SEYMOUR_PARAMS Parameters for Seymour decomposition algorithm. More... struct CMR_SEYMOUR_STATS Statistics for Seymour decomposition algorithm. More... Typedefs
typedef struct _CMR_SEYMOUR_NODE CMR_SEYMOUR_NODE Functions
CMR_EXPORT CMR_ERROR CMRseymourParamsInit (CMR_SEYMOUR_PARAMS *params) Initializes the default parameters for regularity testing. More... CMR_EXPORT CMR_ERROR CMRseymourStatsInit (CMR_SEYMOUR_STATS *stats) Initializes all statistics for Seymour decomposition computations. More... CMR_EXPORT CMR_ERROR CMRseymourStatsPrint (FILE *stream, CMR_SEYMOUR_STATS *stats, const char *prefix) Prints statistics for Seymour decomposition computations. More... CMR_EXPORT bool CMRseymourIsTernary (CMR_SEYMOUR_NODE *node) Returns trueiff the decomposition is over \( \mathbb{F}_3 \). More...CMR_EXPORT size_t * CMRseymourPivotColumns (CMR_SEYMOUR_NODE *node) Returns the array with the pivot columns (if available). More... CMR_EXPORT size_t CMRseymourGetUsed (CMR_SEYMOUR_NODE *node) Returns node's reference counter. More... CMR_EXPORT CMR_ERROR CMRseymourPrint (CMR *cmr, CMR_SEYMOUR_NODE *node, FILE *stream, bool printChildren, bool printParentElements, bool printMatrices, bool printGraphs, bool printReductions, bool printPivots) Prints the decomposition dectostream. More...CMR_EXPORT CMR_ERROR CMRseymourCloneUnknown (CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEYMOUR_NODE **pclone) Clones a decomposition node decinto*pclonewhich represents the same matrix but has type CMR_SEYMOUR_NODE_TYPE_UNKNOWN type. More...CMR_EXPORT CMR_ERROR CMRseymourCapture (CMR *cmr, CMR_SEYMOUR_NODE *node) Increases the reference counter by 1. More... CMR_EXPORT CMR_ERROR CMRseymourCreate (CMR *cmr, CMR_SEYMOUR_NODE **pnode, bool isTernary, CMR_CHRMAT *matrix) Creates an unknown decomposition node as a root. More... CMR_EXPORT CMR_ERROR CMRregularityCloneSubtrees (CMR *cmr, size_t numSubtrees, CMR_SEYMOUR_NODE **subtreeRoots, CMR_SEYMOUR_NODE **clonedSubtrees) Clones the union of subtrees, returning the copies. More... CMR_EXPORT CMR_ERROR CMRseymourCloneUnknown (CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEYMOUR_NODE **pclone) Clones a decomposition node nodeinto*pclonewhich represents the same matrix but has type CMR_SEYMOUR_NODE_TYPE_UNKNOWN type and no child nodes. More...CMR_EXPORT CMR_ERROR CMRseymourCloneSubtrees (CMR *cmr, size_t numSubtrees, CMR_SEYMOUR_NODE **subtreeRoots, CMR_SEYMOUR_NODE **clonedSubtrees) Clones the union of subtrees of a Seymour decomposition, returning the copies. More... Detailed Description
Functionality for Seymour decomposition.
diff --git a/seymour_8h_source.html b/seymour_8h_source.html index ef8e86ec..c1ccc333 100644 --- a/seymour_8h_source.html +++ b/seymour_8h_source.html @@ -80,355 +80,451 @@seymour.h-Go to the documentation of this file.+Go to the documentation of this file.- - + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - - - - - - - - -499 CMR_ERROR CMRregularityCloneSubtrees(CMR* cmr, size_t numSubtrees, CMR_SEYMOUR_NODE** subtreeRoots,- - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +632 CMR_ERROR CMRseymourCloneSubtrees(CMR* cmr, size_t numSubtrees, CMR_SEYMOUR_NODE** subtreeRoots,+ + + + + + +Basic functionality of the software library.-Functionality for graphs.-CMR_EXPORT bool CMRseymourHasTranspose(CMR_SEYMOUR_NODE *node)Returns true iff the transposed matrix of the decomposition node dec is stored.Definition: seymour.c:43-CMR_EXPORT int8_t CMRseymourCographicness(CMR_SEYMOUR_NODE *node)Indicates cographicness/being conetwork.Definition: seymour.c:87-CMR_EXPORT CMR_ELEMENT * CMRseymourChildRowsToParent(CMR_SEYMOUR_NODE *node, size_t childIndex)Returns the mapping of rows of child childIndex to this node's elements.Definition: seymour.c:108-CMR_EXPORT size_t CMRseymourNumPivots(CMR_SEYMOUR_NODE *node)Returns the number of pivots (if available).Definition: seymour.c:247-CMR_EXPORT size_t CMRseymourNumRows(CMR_SEYMOUR_NODE *node)Returns the number of rows.Definition: seymour.c:101-CMR_EXPORT CMR_ERROR CMRregularityCloneSubtrees(CMR *cmr, size_t numSubtrees, CMR_SEYMOUR_NODE **subtreeRoots, CMR_SEYMOUR_NODE **clonedSubtrees)Clones the union of subtrees, returning the copies.Definition: seymour.c:1924-CMR_EXPORT size_t CMRseymourCographSizeForest(CMR_SEYMOUR_NODE *node)Returns the number of edges of the cograph's forest (if available).Definition: seymour.c:198-CMR_EXPORT bool CMRseymourIsTernary(CMR_SEYMOUR_NODE *node)Returns true iff the decomposition is over .Definition: seymour.c:13-CMR_SEYMOUR_NODE_THREESUM_FLAGFlags that indicate the type of -separation.Definition: seymour.h:67-CMR_EXPORT CMR_CHRMAT * CMRseymourGetTranspose(CMR_SEYMOUR_NODE *node)Returns the transposed matrix of the decomposition node dec (or NULL if it is not stored).Definition: seymour.c:50-CMR_EXPORT CMR_SEYMOUR_NODE * CMRseymourChild(CMR_SEYMOUR_NODE *node, size_t childIndex)Returns a child of the decomposition node dec.Definition: seymour.c:64-CMR_EXPORT CMR_GRAPH * CMRseymourCograph(CMR_SEYMOUR_NODE *node)Returns the cograph (if available).Definition: seymour.c:191-CMR_EXPORT CMR_ELEMENT * CMRseymourChildColumnsToParent(CMR_SEYMOUR_NODE *node, size_t childIndex)Returns the mapping of columns of child childIndex to this node's elements.Definition: seymour.c:118-CMR_EXPORT CMR_ERROR CMRseymourRelease(CMR *cmr, CMR_SEYMOUR_NODE **pnode)Releases a decomposition node, freeing it if this was the last reference.Definition: seymour.c:500-CMR_EXPORT size_t CMRseymourNumChildren(CMR_SEYMOUR_NODE *node)Returns the number of children of the decomposition node dec.Definition: seymour.c:57-CMR_EXPORT CMR_ERROR CMRseymourCapture(CMR *cmr, CMR_SEYMOUR_NODE *node)Increases the reference counter by 1.Definition: seymour.c:490-CMR_EXPORT CMR_GRAPH * CMRseymourGraph(CMR_SEYMOUR_NODE *node)Returns the graph (if available).Definition: seymour.c:135-CMR_EXPORT bool * CMRseymourGraphArcsReversed(CMR_SEYMOUR_NODE *node)Returns an array that indicates for the graph's edges whether they must be reversed (if available).Definition: seymour.c:184-CMR_EXPORT CMR_ERROR CMRseymourCreate(CMR *cmr, CMR_SEYMOUR_NODE **pnode, bool isTernary, CMR_CHRMAT *matrix)Creates an unknown decomposition node as a root.Definition: seymour.c:803-CMR_EXPORT CMR_GRAPH_EDGE * CMRseymourGraphCoforest(CMR_SEYMOUR_NODE *node)Returns the coforest of the graph (if available).Definition: seymour.c:163-CMR_EXPORT int8_t CMRseymourGraphicness(CMR_SEYMOUR_NODE *node)Indicates graphicness/being network.Definition: seymour.c:80-CMR_EXPORT size_t CMRseymourCographSizeCoforest(CMR_SEYMOUR_NODE *node)Returns the number of edges of the cograph's coforest (if available).Definition: seymour.c:219-CMR_EXPORT size_t * CMRseymourPivotColumns(CMR_SEYMOUR_NODE *node)Returns the array with the pivot columns (if available).Definition: seymour.c:261-CMR_EXPORT CMR_ERROR CMRseymourPrint(CMR *cmr, CMR_SEYMOUR_NODE *node, FILE *stream, bool printChildren, bool printParentElements, bool printMatrices, bool printGraphs, bool printReductions, bool printPivots)Prints the decomposition dec to stream.Definition: seymour.c:478-CMR_EXPORT size_t CMRseymourNumColumns(CMR_SEYMOUR_NODE *node)Returns the number of columns.Definition: seymour.c:128-CMR_EXPORT bool CMRseymourThreeSumConcentratedRank(CMR_SEYMOUR_NODE *node)Returns true iff the 3-sum decomposition node has -separation with one rank-2 matrix.Definition: seymour.c:28- -CMR_EXPORT CMR_SEYMOUR_NODE_TYPE CMRseymourType(CMR_SEYMOUR_NODE *node)Returns the type of a decomposition node dec.Definition: seymour.c:72-CMR_EXPORT size_t CMRseymourGraphSizeCoforest(CMR_SEYMOUR_NODE *node)Returns the number of edges of the graph's coforest (if available).Definition: seymour.c:170-CMR_EXPORT CMR_ERROR CMRseymourCloneUnknown(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEYMOUR_NODE **pclone)Clones a decomposition node dec into *pclone which represents the same matrix but has type CMR_SEYMOU...Definition: seymour.c:667-CMR_EXPORT CMR_MINOR * CMRseymourMinor(CMR_SEYMOUR_NODE *node, size_t minorIndex)Returns a minor of the decomposition node.Definition: seymour.c:844-CMR_EXPORT size_t CMRseymourNumMinors(CMR_SEYMOUR_NODE *node)Returns the number of minors of the decomposition node.Definition: seymour.c:837-CMR_EXPORT int8_t CMRseymourRegularity(CMR_SEYMOUR_NODE *node)Indicates regularity/total unimodularity.Definition: seymour.c:94-CMR_EXPORT CMR_GRAPH_EDGE * CMRseymourGraphForest(CMR_SEYMOUR_NODE *node)Returns the forest of the graph (if available).Definition: seymour.c:142-CMR_EXPORT CMR_GRAPH_EDGE * CMRseymourCographForest(CMR_SEYMOUR_NODE *node)Returns the forest of the cograph (if available).Definition: seymour.c:212-CMR_EXPORT size_t CMRseymourGraphSizeForest(CMR_SEYMOUR_NODE *dec)Returns the number of edges of the graph's forest (if available).Definition: seymour.c:149-CMR_EXPORT CMR_GRAPH_EDGE * CMRseymourCographCoforest(CMR_SEYMOUR_NODE *node)Returns the coforest of the cograph (if available).Definition: seymour.c:233-CMR_EXPORT bool * CMRseymourCographArcsReversed(CMR_SEYMOUR_NODE *node)Returns an array that indicates for the cograph's edges whether they must be reversed (if available).Definition: seymour.c:240-CMR_EXPORT bool CMRseymourThreeSumDistributedRanks(CMR_SEYMOUR_NODE *node)Returns true iff the 3-sum decomposition node has -separation with two rank-1 matrices.Definition: seymour.c:20-CMR_EXPORT size_t * CMRseymourPivotRows(CMR_SEYMOUR_NODE *node)Returns the array with the pivot rows (if available).Definition: seymour.c:254-CMR_EXPORT CMR_CHRMAT * CMRseymourGetMatrix(CMR_SEYMOUR_NODE *node)Returns the matrix of the decomposition node dec (or NULL if it is not stored).Definition: seymour.c:36-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_ALLREPRDefinition: seymour.h:101-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_WIDEDefinition: seymour.h:79-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_WIDEDefinition: seymour.h:92-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_NO_PIVOTSDefinition: seymour.h:68-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_TALLDefinition: seymour.h:95-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_SECOND_MIXEDDefinition: seymour.h:98-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_CONCENTRATED_RANKDefinition: seymour.h:75-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_DISTRIBUTED_RANKSDefinition: seymour.h:72-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_SEYMOURDefinition: seymour.h:105-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_ALLREPRDefinition: seymour.h:88-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_MIXEDDefinition: seymour.h:85-@ CMR_SEYMOUR_NODE_THREESUM_FLAG_TRUEMPERDefinition: seymour.h:109- -@ CMR_SEYMOUR_NODE_THREESUM_FLAG_FIRST_TALLDefinition: seymour.h:82- - - - - - - - - +@ CMR_SEYMOUR_NODE_TYPE_SERIES_PARALLELDefinition: seymour.h:45+CMR_EXPORT bool CMRseymourHasTranspose(CMR_SEYMOUR_NODE *node)Returns true iff the transposed matrix of the decomposition node dec is stored.Definition: seymour.c:118+CMR_EXPORT int8_t CMRseymourCographicness(CMR_SEYMOUR_NODE *node)Indicates cographicness/being conetwork.Definition: seymour.c:162+CMR_EXPORT CMR_ELEMENT * CMRseymourChildRowsToParent(CMR_SEYMOUR_NODE *node, size_t childIndex)Returns the mapping of rows of child childIndex to this node's elements.Definition: seymour.c:183+CMR_EXPORT size_t CMRseymourNumPivots(CMR_SEYMOUR_NODE *node)Returns the number of pivots (if available).Definition: seymour.c:322+CMR_EXPORT size_t CMRseymourNumRows(CMR_SEYMOUR_NODE *node)Returns the number of rows.Definition: seymour.c:176+CMR_EXPORT size_t CMRseymourGetUsed(CMR_SEYMOUR_NODE *node)Returns node's reference counter.Definition: seymour.c:343+CMR_EXPORT size_t CMRseymourCographSizeForest(CMR_SEYMOUR_NODE *node)Returns the number of edges of the cograph's forest (if available).Definition: seymour.c:273+CMR_EXPORT bool CMRseymourIsTernary(CMR_SEYMOUR_NODE *node)Returns true iff the decomposition is over .Definition: seymour.c:88+CMR_EXPORT CMR_CHRMAT * CMRseymourGetTranspose(CMR_SEYMOUR_NODE *node)Returns the transposed matrix of the decomposition node dec (or NULL if it is not stored).Definition: seymour.c:125+CMR_EXPORT CMR_SEYMOUR_NODE * CMRseymourChild(CMR_SEYMOUR_NODE *node, size_t childIndex)Returns a child of the decomposition node dec.Definition: seymour.c:139+CMR_EXPORT CMR_GRAPH * CMRseymourCograph(CMR_SEYMOUR_NODE *node)Returns the cograph (if available).Definition: seymour.c:266+CMR_EXPORT CMR_ELEMENT * CMRseymourChildColumnsToParent(CMR_SEYMOUR_NODE *node, size_t childIndex)Returns the mapping of columns of child childIndex to this node's elements.Definition: seymour.c:193+CMR_EXPORT CMR_ERROR CMRseymourRelease(CMR *cmr, CMR_SEYMOUR_NODE **pnode)Releases a decomposition node, freeing it if this was the last reference.Definition: seymour.c:583+CMR_EXPORT size_t CMRseymourNumChildren(CMR_SEYMOUR_NODE *node)Returns the number of children of the decomposition node dec.Definition: seymour.c:132+CMR_EXPORT CMR_ERROR CMRseymourCapture(CMR *cmr, CMR_SEYMOUR_NODE *node)Increases the reference counter by 1.Definition: seymour.c:573+CMR_EXPORT CMR_GRAPH * CMRseymourGraph(CMR_SEYMOUR_NODE *node)Returns the graph (if available).Definition: seymour.c:210+CMR_EXPORT bool * CMRseymourGraphArcsReversed(CMR_SEYMOUR_NODE *node)Returns an array that indicates for the graph's edges whether they must be reversed (if available).Definition: seymour.c:259+CMR_SEYMOUR_THREESUM_FLAGFlags that indicate the type of -separation.Definition: seymour.h:40+CMR_EXPORT CMR_ERROR CMRseymourCreate(CMR *cmr, CMR_SEYMOUR_NODE **pnode, bool isTernary, CMR_CHRMAT *matrix)Creates an unknown decomposition node as a root.Definition: seymour.c:886+CMR_EXPORT CMR_GRAPH_EDGE * CMRseymourGraphCoforest(CMR_SEYMOUR_NODE *node)Returns the coforest of the graph (if available).Definition: seymour.c:238+CMR_EXPORT int8_t CMRseymourGraphicness(CMR_SEYMOUR_NODE *node)Indicates graphicness/being network.Definition: seymour.c:155+CMR_EXPORT size_t CMRseymourCographSizeCoforest(CMR_SEYMOUR_NODE *node)Returns the number of edges of the cograph's coforest (if available).Definition: seymour.c:294+CMR_EXPORT size_t * CMRseymourPivotColumns(CMR_SEYMOUR_NODE *node)Returns the array with the pivot columns (if available).Definition: seymour.c:336+CMR_EXPORT CMR_ERROR CMRseymourPrint(CMR *cmr, CMR_SEYMOUR_NODE *node, FILE *stream, bool printChildren, bool printParentElements, bool printMatrices, bool printGraphs, bool printReductions, bool printPivots)Prints the decomposition dec to stream.Definition: seymour.c:561+CMR_EXPORT size_t CMRseymourNumColumns(CMR_SEYMOUR_NODE *node)Returns the number of columns.Definition: seymour.c:203+CMR_EXPORT bool CMRseymourThreeSumConcentratedRank(CMR_SEYMOUR_NODE *node)Returns true iff the 3-sum decomposition node has -separation with one rank-2 matrix.Definition: seymour.c:103+ +CMR_EXPORT CMR_SEYMOUR_NODE_TYPE CMRseymourType(CMR_SEYMOUR_NODE *node)Returns the type of a decomposition node dec.Definition: seymour.c:147+CMR_EXPORT size_t CMRseymourGraphSizeCoforest(CMR_SEYMOUR_NODE *node)Returns the number of edges of the graph's coforest (if available).Definition: seymour.c:245+CMR_EXPORT CMR_ERROR CMRseymourCloneUnknown(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEYMOUR_NODE **pclone)Clones a decomposition node node into *pclone which represents the same matrix but has type CMR_SEYMO...Definition: seymour.c:750+CMR_EXPORT CMR_MINOR * CMRseymourMinor(CMR_SEYMOUR_NODE *node, size_t minorIndex)Returns a minor of the decomposition node.Definition: seymour.c:927+CMR_EXPORT CMR_ERROR CMRseymourStatsInit(CMR_SEYMOUR_STATS *stats)Initializes all statistics for Seymour decomposition computations.Definition: seymour.c:36+CMR_EXPORT CMR_ERROR CMRseymourParamsInit(CMR_SEYMOUR_PARAMS *params)Initializes the default parameters for regularity testing.Definition: seymour.c:14+CMR_EXPORT size_t CMRseymourNumMinors(CMR_SEYMOUR_NODE *node)Returns the number of minors of the decomposition node.Definition: seymour.c:920+CMR_EXPORT int8_t CMRseymourRegularity(CMR_SEYMOUR_NODE *node)Indicates regularity/total unimodularity.Definition: seymour.c:169+CMR_EXPORT CMR_ERROR CMRseymourStatsPrint(FILE *stream, CMR_SEYMOUR_STATS *stats, const char *prefix)Prints statistics for Seymour decomposition computations.Definition: seymour.c:56+CMR_EXPORT CMR_GRAPH_EDGE * CMRseymourGraphForest(CMR_SEYMOUR_NODE *node)Returns the forest of the graph (if available).Definition: seymour.c:217+CMR_EXPORT CMR_GRAPH_EDGE * CMRseymourCographForest(CMR_SEYMOUR_NODE *node)Returns the forest of the cograph (if available).Definition: seymour.c:287+CMR_EXPORT size_t CMRseymourGraphSizeForest(CMR_SEYMOUR_NODE *dec)Returns the number of edges of the graph's forest (if available).Definition: seymour.c:224+CMR_EXPORT CMR_GRAPH_EDGE * CMRseymourCographCoforest(CMR_SEYMOUR_NODE *node)Returns the coforest of the cograph (if available).Definition: seymour.c:308+CMR_EXPORT bool * CMRseymourCographArcsReversed(CMR_SEYMOUR_NODE *node)Returns an array that indicates for the cograph's edges whether they must be reversed (if available).Definition: seymour.c:315+CMR_EXPORT bool CMRseymourThreeSumDistributedRanks(CMR_SEYMOUR_NODE *node)Returns true iff the 3-sum decomposition node has -separation with two rank-1 matrices.Definition: seymour.c:95+CMR_EXPORT size_t * CMRseymourPivotRows(CMR_SEYMOUR_NODE *node)Returns the array with the pivot rows (if available).Definition: seymour.c:329+CMR_EXPORT CMR_ERROR CMRseymourCloneSubtrees(CMR *cmr, size_t numSubtrees, CMR_SEYMOUR_NODE **subtreeRoots, CMR_SEYMOUR_NODE **clonedSubtrees)Clones the union of subtrees of a Seymour decomposition, returning the copies.Definition: seymour.c:2016+CMR_EXPORT CMR_CHRMAT * CMRseymourGetMatrix(CMR_SEYMOUR_NODE *node)Returns the matrix of the decomposition node dec (or NULL if it is not stored).Definition: seymour.c:111+@ CMR_SEYMOUR_THREESUM_FLAG_FIRST_MIXEDDefinition: seymour.h:58+@ CMR_SEYMOUR_THREESUM_FLAG_FIRST_ALLREPRDefinition: seymour.h:61+ +@ CMR_SEYMOUR_THREESUM_FLAG_SECOND_WIDEDefinition: seymour.h:65+ + +@ CMR_SEYMOUR_THREESUM_FLAG_SECOND_TALLDefinition: seymour.h:68+@ CMR_SEYMOUR_THREESUM_FLAG_CONCENTRATED_RANKDefinition: seymour.h:48+ +@ CMR_SEYMOUR_THREESUM_FLAG_SECOND_MIXEDDefinition: seymour.h:71+@ CMR_SEYMOUR_THREESUM_FLAG_DISTRIBUTED_RANKSDefinition: seymour.h:45+ + +@ CMR_SEYMOUR_THREESUM_FLAG_SECOND_ALLREPRDefinition: seymour.h:74+ + + + + + + + +@ CMR_SEYMOUR_NODE_TYPE_SERIES_PARALLELDefinition: seymour.h:223Functionality for sparse matrices.+Functionality for matroids.+Computation and recognition of network matrices and conetwork matrices.Recognition of series-parallel matrices.+Definition: env_internal.h:45- -Definition: graph.h:49-Definition: seymour_internal.h:17-bool isTernaryIndicates whether this node belongs to a ternary matrix.Definition: seymour_internal.h:20+ +CMR_CHRMAT * matrixMatrix representing this node.Definition: seymour_internal.h:31+ +Statistics for recognition algorithm for network matrices.Definition: network.h:36+bool threeSumPivotChildrenWhether pivots for 3-sums shall be applied such that the matrix contains both child matrices as subma...Definition: seymour.h:113+int threeSumStrategyWhether to perform pivots to change the rank distribution, and how to construct the children.Definition: seymour.h:116+bool planarityCheckWhether minors identified as graphic should still be checked for cographicness; default: false.Definition: seymour.h:106+bool constructLeafGraphsWhether to construct (co)graphs for all leaf nodes that are (co)graphic or (co)network.Definition: seymour.h:147+bool stopWhenNongraphicWhether to stop decomposing once non-graphicness (or being non-network) is determined.Definition: seymour.h:96+bool preferGraphicnessWhether to first test for (co)graphicness (or being (co)network) before applying series-parallel redu...Definition: seymour.h:110+bool stopWhenNoncographicWhether to stop decomposing once non-cographicness (or being non-conetwork) is determined.Definition: seymour.h:98+bool directGraphicnessWhether to use fast graphicness routines; default: true.Definition: seymour.h:108+bool seriesParallelWhether to allow series-parallel operations in the decomposition tree; default: true.Definition: seymour.h:104+bool stopWhenNeitherGraphicNorCoGraphicWhether to stop decomposing once non-graphicness and non-cographicness (or not being network and not ...Definition: seymour.h:100+bool constructAllGraphsWhether to construct (co)graphs for all nodes that are (co)graphic or (co)network.Definition: seymour.h:149+ + + + + +bool stopWhenIrregularWhether to stop decomposing once irregularity is determined.Definition: seymour.h:94+ + + + + + + +uint32_t enumerationCandidatesCountDefinition: seymour.h:181+Statistics for series-parallel recognition algorithm.Definition: series_parallel.h:25+Definition: seymour_internal.h:16+bool isTernaryIndicates whether this node belongs to a ternary matrix.Definition: seymour_internal.h:19CMR_CHRMAT * matrixMatrix representing this node.Definition: seymour_internal.h:30
diff --git a/seymour__internal_8h.html b/seymour__internal_8h.html index 59c4dc1d..2e5eeec7 100644 --- a/seymour__internal_8h.html +++ b/seymour__internal_8h.html @@ -78,6 +78,7 @@@@ -94,6 +95,17 @@ Classesseymour_internal.h File Referencestruct _CMR_SEYMOUR_NODE struct DecompositionTask struct DecompositionQueue +
+Typedefs
typedef struct DecompositionTask DecompositionTask typedef struct DecompositionQueue DecompositionQueue
+Functions
CMR_ERROR CMRseymourSetAttributes (CMR_SEYMOUR_NODE *node) Set regularity and (co)graphicness attributes of a decomposition tree. More... CMR_ERROR CMRregularityTaskCreateRoot (CMR *cmr, CMR_SEYMOUR_NODE *dec, DecompositionTask **ptask, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, clock_t startClock, double timeLimit) Creates a decomposition task for the root of the decomposition. More... CMR_ERROR CMRregularityTaskFree (CMR *cmr, DecompositionTask **ptask) Frees a decomposition task. More... CMR_ERROR CMRregularityQueueCreate (CMR *cmr, DecompositionQueue **pqueue) Initializes a decomposition queue. More... CMR_ERROR CMRregularityQueueFree (CMR *cmr, DecompositionQueue **pqueue) Frees the decomposition queue. More... bool CMRregularityQueueEmpty (DecompositionQueue *queue) Returns whether a queue is empty. More... DecompositionTask * CMRregularityQueueRemove (DecompositionQueue *queue) Removes a task from a decomposition queue. More... void CMRregularityQueueAdd (DecompositionQueue *queue, DecompositionTask *task) Adds a task to a decomposition queue. More... CMR_ERROR CMRregularityDecomposeThreeSum (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue, CMR_SEPA *separation) Applies a 3-sum decomposition. More... CMR_ERROR CMRregularityNestedMinorSequenceSearchThreeSeparation (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Searches for 3-separations along the sequence of nested minors and decomposes as a 3-sum. More... CMR_ERROR CMRregularityNestedMinorSequenceGraphicness (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Tests each minor of the sequence of nested 3-connected minors for graphicness. More... CMR_ERROR CMRregularityNestedMinorSequenceCographicness (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Tests each minor of the sequence of nested 3-connected minors for graphicness. More... CMR_ERROR CMRregularityExtendNestedMinorSequence (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Extends an incomplete sequence of nested 3-connected minors for the matrix of a decomposition node. More... CMR_ERROR CMRregularityTestR10 (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Tests matrixfor representing \( R_{10} \). More...CMR_ERROR CMRregularityInitNestedMinorSequence (CMR *cmr, DecompositionTask *task, CMR_SUBMAT *wheelSubmatrix) Initializes a sequence of nested minors with one minor, for a given wheelSubmatrix. More...CMR_ERROR CMRregularityDecomposeSeriesParallel (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Splits off series-parallel elements from the matrix of the decomposition node. More... CMR_ERROR CMRregularityTestGraphicness (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Tests matrixfor graphicness/network and stores it indec. More...CMR_ERROR CMRregularityTestCographicness (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Tests matrixfor cographicness/conetwork and stores it indec. More...CMR_ERROR CMRregularitySearchOneSum (CMR *cmr, DecompositionTask *task, DecompositionQueue *queue) Performs a 1-sum decomposition of matrixand stores it indec. More...CMR_ERROR CMRseymourDecompose (CMR *cmr, CMR_CHRMAT *matrix, bool ternary, CMR_SEYMOUR_NODE **proot, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit) Tests ternary or binary linear matroid for regularity. More... CMR_ERROR CMRregularityCompleteDecomposition (CMR *cmr, CMR_SEYMOUR_NODE *subtree, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit) Replaces the subtree of a matroid decomposition tree by a new one. More... CMR_ERROR CMRregularityRefineDecomposition (CMR *cmr, size_t numNodes, CMR_SEYMOUR_NODE **nodes, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit) Replaces the subtrees of several nodes of a matroid decomposition tree by new ones. More... Typedef Documentation
+ +◆ DecompositionQueue
+ +++ +++
++ +typedef struct DecompositionQueue DecompositionQueue ++ ++◆ DecompositionTask
+ ++++
++ +typedef struct DecompositionTask DecompositionTask ++ ++Function Documentation
- -◆ CMRseymourAddMinor()
+ +◆ CMRregularityCompleteDecomposition()
- CMR_ERROR CMRseymourAddMinor +CMR_ERROR CMRregularityCompleteDecomposition ( CMR * cmr, @@ -163,13 +267,25 @@CMR_SEYMOUR_NODE * -node, +subtree, - CMR_MINOR * -minor +CMR_SEYMOUR_PARAMS * +params, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ + + double +timeLimit @@ -179,36 +295,43 @@ -
Adds a minor to a Seymour decomposition node.
-Does not copy the minor.
+Replaces the subtree of a matroid decomposition tree by a new one.
- Parameters
-
cmr CMR environment. node Seymour decomposition node. minor Minor to be added. subtree Decomposition node of the subtree root. params Parameters for the computation. stats Statistics for the computation (may be NULL).timeLimit Time limit to impose.
◆ CMRseymourConsistency()
+ +◆ CMRregularityDecomposeSeriesParallel()
- char* CMRseymourConsistency +CMR_ERROR CMRregularityDecomposeSeriesParallel ( -CMR_SEYMOUR_NODE * -node, +CMR * +cmr, - bool -recurse +DecompositionTask * +task, ++ + + DecompositionQueue * +queue @@ -218,28 +341,28 @@ -
Checks a Seymour decomposition node for consistency.
-Checks all requirements defined in Representation of Matroids and their Decomposition.
-- Returns
NULLif consistent. Otherwise, an explanation string is returned, which must freed withfree().
- See also
- CMRconsistencyAssert() for checking the returned string and aborting in case of inconsistency.
Splits off series-parallel elements from the matrix of the decomposition node.
+In case the matrix is Series-Parallel Matroids, then the node is declared to be planar.
+In case the matrix does not admit series-parallel reductions, then the node remains remain unchanged. Otherwise, a child node is created whose matrix is the series-parallel-reduced one. For that child node, a 2-separation may be found, and corresponding children will be created.
- Parameters
-
-
node Seymour decomposition node. recurse Whether all (grand-)children shall be checked, too. cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
◆ CMRseymourCreateChildFromMatrices()
+ +◆ CMRregularityDecomposeThreeSum()
+ +
+- CMR_ERROR CMRseymourCreateChildFromMatrices +CMR_ERROR CMRregularityDecomposeThreeSum ( CMR * cmr, @@ -247,38 +370,110 @@- CMR_SEYMOUR_NODE * -parent, +DecompositionTask * +task, - size_t -childIndex, +DecompositionQueue * +queue, - CMR_CHRMAT * -matrix, +CMR_SEPA * +separation ++ ++ ) ++ + ++Applies a 3-sum decomposition.
+- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes. separation 3-separation.
+
◆ CMRregularityExtendNestedMinorSequence()
+ +++ +++
++ CMR_ERROR CMRregularityExtendNestedMinorSequence +( +CMR * +cmr, - CMR_CHRMAT * -transpose, +DecompositionTask * +task, - CMR_ELEMENT * -rowsToParent, +DecompositionQueue * +queue ++ ++ ) ++ + ++Extends an incomplete sequence of nested 3-connected minors for the matrix of a decomposition node.
+In case the matrix is not 3-connected, a 2-separation is applied to
+decand the function terminates, filling the relevant variables ofdec.- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
+
◆ CMRregularityInitNestedMinorSequence()
+ ++++
+ CMR_ERROR CMRregularityInitNestedMinorSequence +( +CMR * +cmr, - CMR_ELEMENT * -columnsToParent +DecompositionTask * +task, ++ + + CMR_SUBMAT * +wheelSubmatrix @@ -288,17 +483,892 @@ -
Creates a decomposition node as a child.
-Copies
+matrixandtransposeinto the node.Initializes a sequence of nested minors with one minor, for a given
wheelSubmatrix.- Parameters
-
+cmr CMR environment. parent Seymour decomposition parent node. childIndex Child index of parent. matrix The matrix corresponding to this node. transpose The transpose matrix corresponding to this node. rowsToParent Array for mapping rows to elements of parent. columnsToParent Array for mapping columns to elements of parent. task Task to be processed; already removed from the list of unprocessed tasks. wheelSubmatrix Wheel submatrix of task->dec.
+
◆ CMRregularityNestedMinorSequenceCographicness()
+ +++ +++
++ +CMR_ERROR CMRregularityNestedMinorSequenceCographicness +( +CMR * +cmr, ++ ++ + DecompositionTask * +task, ++ ++ + DecompositionQueue * +queue ++ ++ ) ++ + ++Tests each minor of the sequence of nested 3-connected minors for graphicness.
+Sets
+task->dec->CMRregularityNestedMinorSequenceCographicnessaccordingly.- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
+
◆ CMRregularityNestedMinorSequenceGraphicness()
+ +++ +++
++ +CMR_ERROR CMRregularityNestedMinorSequenceGraphicness +( +CMR * +cmr, ++ ++ + DecompositionTask * +task, ++ ++ + DecompositionQueue * +queue ++ ++ ) ++ + ++Tests each minor of the sequence of nested 3-connected minors for graphicness.
+Sets
+task->dec->CMRregularityNestedMinorSequenceGraphicnessaccordingly.- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
+
◆ CMRregularityNestedMinorSequenceSearchThreeSeparation()
+ +++ +++
++ +CMR_ERROR CMRregularityNestedMinorSequenceSearchThreeSeparation +( +CMR * +cmr, ++ ++ + DecompositionTask * +task, ++ ++ + DecompositionQueue * +queue ++ ++ ) ++ + ++Searches for 3-separations along the sequence of nested minors and decomposes as a 3-sum.
+- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
+
◆ CMRregularityQueueAdd()
+ +++ +++
++ +void CMRregularityQueueAdd +( +DecompositionQueue * +queue, ++ ++ + DecompositionTask * +task ++ ++ ) ++ + ++Adds a task to a decomposition queue.
+- Parameters
-
+
+
+queue Queue. task Task.
+
◆ CMRregularityQueueCreate()
+ +++ +++
++ +CMR_ERROR CMRregularityQueueCreate +( +CMR * +cmr, ++ ++ + DecompositionQueue ** +pqueue ++ ++ ) ++ + ++Initializes a decomposition queue.
+- Parameters
-
+
+
+cmr CMR environment. pqueue Pointer for storing the queue.
+
◆ CMRregularityQueueEmpty()
+ +++ +++
++ +bool CMRregularityQueueEmpty +( +DecompositionQueue * +queue ) ++ + ++Returns whether a queue is empty.
+- Parameters
-
+
+
+queue Queue.
+
◆ CMRregularityQueueFree()
+ +++ +++
++ +CMR_ERROR CMRregularityQueueFree +( +CMR * +cmr, ++ ++ + DecompositionQueue ** +pqueue ++ ++ ) ++ + ++Frees the decomposition queue.
+- Parameters
-
+
+
+cmr CMR environment. pqueue Pointer to queue.
+
◆ CMRregularityQueueRemove()
+ +++ +++
++ +DecompositionTask* CMRregularityQueueRemove +( +DecompositionQueue * +queue ) ++ + ++Removes a task from a decomposition queue.
+- Parameters
-
+
+
+queue Queue.
+
◆ CMRregularityRefineDecomposition()
+ +++ +++
++ +CMR_ERROR CMRregularityRefineDecomposition +( +CMR * +cmr, ++ ++ + size_t +numNodes, ++ ++ + CMR_SEYMOUR_NODE ** +nodes, ++ ++ + CMR_SEYMOUR_PARAMS * +params, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ ++ + double +timeLimit ++ ++ ) ++ + ++Replaces the subtrees of several nodes of a matroid decomposition tree by new ones.
+- Parameters
-
+
+
+cmr CMR environment. numNodes Number of nodes to refine. nodes Array of decomposition nodes to refine. params Parameters for the computation. stats Statistics for the computation (may be NULL).timeLimit Time limit to impose.
+
◆ CMRregularitySearchOneSum()
+ +++ +++
++ +CMR_ERROR CMRregularitySearchOneSum +( +CMR * +cmr, ++ ++ + DecompositionTask * +task, ++ ++ + DecompositionQueue * +queue ++ ++ ) ++ + ++Performs a 1-sum decomposition of
+matrixand stores it indec.If
+matrixis 1-connected, thendecremains unchanged. Otherwise,decwill become a CMR_MATROID_DEC_TYPE_ONE_SUM node with children that are initialized to the 1-connected components. In this case, thematrixandtransposemembers of the child nodes are set.- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
+
◆ CMRregularityTaskCreateRoot()
+ +++ +++
++ +CMR_ERROR CMRregularityTaskCreateRoot +( +CMR * +cmr, ++ ++ + CMR_SEYMOUR_NODE * +dec, ++ ++ + DecompositionTask ** +ptask, ++ ++ + CMR_SEYMOUR_PARAMS * +params, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ ++ + clock_t +startClock, ++ ++ + double +timeLimit ++ ++ ) ++ + ++Creates a decomposition task for the root of the decomposition.
+- Parameters
-
+
+
+cmr CMR environment. dec Decomposition node. ptask Pointer for storing the new task. params Parameters for the computation. stats Statistics for the computation (may be NULL).startClock Clock for the start time. timeLimit Time limit to impose.
+
◆ CMRregularityTaskFree()
+ +++ +++
++ +CMR_ERROR CMRregularityTaskFree +( +CMR * +cmr, ++ ++ + DecompositionTask ** +ptask ++ ++ ) ++ + ++Frees a decomposition task.
+- Parameters
-
+
+
+cmr CMR environment. ptask Pointer to task.
+
◆ CMRregularityTestCographicness()
+ +++ +++
++ +CMR_ERROR CMRregularityTestCographicness +( +CMR * +cmr, ++ ++ + DecompositionTask * +task, ++ ++ + DecompositionQueue * +queue ++ ++ ) ++ + ++Tests
+matrixfor cographicness/conetwork and stores it indec.- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
+
◆ CMRregularityTestGraphicness()
+ +++ +++
++ +CMR_ERROR CMRregularityTestGraphicness +( +CMR * +cmr, ++ ++ + DecompositionTask * +task, ++ ++ + DecompositionQueue * +queue ++ ++ ) ++ + ++Tests
+matrixfor graphicness/network and stores it indec.- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
+
◆ CMRregularityTestR10()
+ +++ +++
++ +CMR_ERROR CMRregularityTestR10 +( +CMR * +cmr, ++ ++ + DecompositionTask * +task, ++ ++ + DecompositionQueue * +queue ++ ++ ) ++ + ++Tests
+matrixfor representing \( R_{10} \).- Parameters
-
+
+
+cmr CMR environment. task Task to be processed; already removed from the list of unprocessed tasks. queue Queue of unprocessed nodes.
+
◆ CMRseymourAddMinor()
+ +++ +++
++ +CMR_ERROR CMRseymourAddMinor +( +CMR * +cmr, ++ ++ + CMR_SEYMOUR_NODE * +node, ++ ++ + CMR_MINOR * +minor ++ ++ ) ++ + ++Adds a minor to a Seymour decomposition node.
+Does not copy the minor.
+- Parameters
-
+
+
+cmr CMR environment. node Seymour decomposition node. minor Minor to be added.
+
◆ CMRseymourConsistency()
+ +++ +++
++ +char* CMRseymourConsistency +( +CMR_SEYMOUR_NODE * +node, ++ ++ + bool +recurse ++ ++ ) ++ + ++Checks a Seymour decomposition node for consistency.
+Checks all requirements defined in Representation of Matroids and their Decomposition.
+- Returns
NULLif consistent. Otherwise, an explanation string is returned, which must freed withfree().
- See also
- CMRconsistencyAssert() for checking the returned string and aborting in case of inconsistency.
- Parameters
-
+
+
+node Seymour decomposition node. recurse Whether all (grand-)children shall be checked, too.
+
◆ CMRseymourCreateChildFromMatrices()
+ +++ +++
++ +CMR_ERROR CMRseymourCreateChildFromMatrices +( +CMR * +cmr, ++ ++ + CMR_SEYMOUR_NODE * +parent, ++ ++ + size_t +childIndex, ++ ++ + CMR_CHRMAT * +matrix, ++ ++ + CMR_CHRMAT * +transpose, ++ ++ + CMR_ELEMENT * +rowsToParent, ++ ++ + CMR_ELEMENT * +columnsToParent ++ ++ ) ++ + ++Creates a decomposition node as a child.
+Copies
+matrixandtransposeinto the node.- Parameters
-
+
+
+cmr CMR environment. parent Seymour decomposition parent node. childIndex Child index of parent. matrix The matrix corresponding to this node. transpose The transpose matrix corresponding to this node. rowsToParent Array for mapping rows to elements of parent. columnsToParent Array for mapping columns to elements of parent.
+
◆ CMRseymourDecompose()
+ ++++
++ +CMR_ERROR CMRseymourDecompose +( +CMR * +cmr, ++ ++ + CMR_CHRMAT * +matrix, ++ ++ + bool +ternary, ++ ++ + CMR_SEYMOUR_NODE ** +proot, ++ ++ + CMR_SEYMOUR_PARAMS * +params, ++ ++ + CMR_SEYMOUR_STATS * +stats, ++ ++ + double +timeLimit ++ ++ ) ++ + +Tests ternary or binary linear matroid for regularity.
+If
+pdecis notNULL,*pdecwill be a (partial) decomposition tree.If
+pminoris notNULLandmatrixis not regular, then an \( F_7 \) or \( F_7^\star \) minor or a submatrix with non-ternary determinant is searched. This causes additional computational effort!- Parameters
-
+
+
cmr CMR environment. matrix Input matrix. ternary Whether the matrix shall be considered ternary. proot Pointer for storing the root of the Seymour decomposition. params Parameters for the computation. stats Statistics for the computation (may be NULL).timeLimit Time limit to impose.
- +CMR_SEYMOUR_NODE_THREESUM_FLAGFlags that indicate the type of -separation.Definition: seymour.h:67+CMR_SEYMOUR_THREESUM_FLAGFlags that indicate the type of -separation.Definition: seymour.h:40Functionality for matroids.Recognition of series-parallel matrices.-Functionality for Seymour decomposition.-CMR_ERROR CMRseymourUpdateThreeSumCreateWideFirstChild(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation, size_t *rowsToChild, size_t *columnsToChild, size_t numChildBaseRows, size_t numChildBaseColumns, size_t extraRow, size_t extraColumn1, size_t extraColumn2, int8_t extraEntry)Creates wide first child of an initialized 3-sum node.Definition: seymour.c:1127-CMR_ERROR CMRseymourAddMinor(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_MINOR *minor)Adds a minor to a Seymour decomposition node.Definition: seymour.c:820-CMR_ERROR CMRseymourCreateChildFromMatrices(CMR *cmr, CMR_SEYMOUR_NODE *parent, size_t childIndex, CMR_CHRMAT *matrix, CMR_CHRMAT *transpose, CMR_ELEMENT *rowsToParent, CMR_ELEMENT *columnsToParent)Creates a decomposition node as a child.Definition: seymour.c:873-CMR_ERROR CMRseymourUpdateThreeSumCreateMixedFirstChild(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation, size_t *rowsToChild, size_t *columnsToChild, size_t numChildBaseRows, size_t numChildBaseColumns, size_t extraRow1, size_t extraRow2, int8_t extraEntry)Creates mixed first child of an initialized 3-sum node.Definition: seymour.c:1417-CMR_ERROR CMRseymourUpdateViolator(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SUBMAT *violator)Initialize an existing unknown decomposition node to be irregular with a violator submatrix.Definition: seymour.c:958-CMR_ERROR CMRseymourSetNumChildren(CMR *cmr, CMR_SEYMOUR_NODE *node, size_t numChildren)Sets the number of children and allocates memory accordingly.Definition: seymour.c:852-CMR_ERROR CMRseymourUpdateSeriesParallel(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SUBMAT *reducedSubmatrix)Updates an existing unknown Seymour decomposition node to be a series-parallel node.Definition: seymour.c:975-CMR_ERROR CMRseymourUpdateThreeSumInit(CMR *cmr, CMR_SEYMOUR_NODE *node)Initialize an existing unknown decomposition node as a 3-sum node.Definition: seymour.c:1116-CMR_ERROR CMRseymourUpdateTwoSum(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation)Initialize an existing unknown decomposition node as a 2-separation node according to the given separ...Definition: seymour.c:997-CMR_ERROR CMRseymourUpdateOneSum(CMR *cmr, CMR_SEYMOUR_NODE *node, size_t numChildren)Initialize an existing unknown decomposition node as a 1-sum with numChildren children.Definition: seymour.c:916-CMR_ERROR CMRseymourSetAttributes(CMR_SEYMOUR_NODE *node)Set regularity and (co)graphicness attributes of a decomposition tree.Definition: seymour.c:1710+CMR_ERROR CMRseymourUpdatePivots(CMR *cmr, CMR_SEYMOUR_NODE *node, size_t numPivots, size_t *pivotRows, size_t *pivotColumns, CMR_CHRMAT *matrix, CMR_CHRMAT *transpose)Initialize an existing unknown decomposition node as a pivot node according to the given arrays of pi...Definition: seymour.c:1080+CMR_ERROR CMRregularityNestedMinorSequenceSearchThreeSeparation(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Searches for 3-separations along the sequence of nested minors and decomposes as a 3-sum.Definition: regularity_partition.c:715+CMR_ERROR CMRregularityTestGraphicness(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Tests matrix for graphicness/network and stores it in dec.Definition: regularity_graphic.c:1796+CMR_ERROR CMRseymourUpdateThreeSumCreateWideFirstChild(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation, size_t *rowsToChild, size_t *columnsToChild, size_t numChildBaseRows, size_t numChildBaseColumns, size_t extraRow, size_t extraColumn1, size_t extraColumn2, int8_t extraEntry)Creates wide first child of an initialized 3-sum node.Definition: seymour.c:1210+CMR_ERROR CMRregularityTestR10(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Tests matrix for representing .Definition: regularity_r10.c:8+CMR_ERROR CMRseymourAddMinor(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_MINOR *minor)Adds a minor to a Seymour decomposition node.Definition: seymour.c:903+CMR_ERROR CMRregularityDecomposeThreeSum(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue, CMR_SEPA *separation)Applies a 3-sum decomposition.Definition: regularity_threesum.c:210+struct DecompositionQueue DecompositionQueue+CMR_ERROR CMRregularityInitNestedMinorSequence(CMR *cmr, DecompositionTask *task, CMR_SUBMAT *wheelSubmatrix)Initializes a sequence of nested minors with one minor, for a given wheelSubmatrix.Definition: regularity_nested_minor_sequence.c:1047+CMR_ERROR CMRregularityRefineDecomposition(CMR *cmr, size_t numNodes, CMR_SEYMOUR_NODE **nodes, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit)Replaces the subtrees of several nodes of a matroid decomposition tree by new ones.Definition: seymour.c:2305+CMR_ERROR CMRregularitySearchOneSum(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Performs a 1-sum decomposition of matrix and stores it in dec.Definition: regularity_onesum.c:20+CMR_ERROR CMRseymourCreateChildFromMatrices(CMR *cmr, CMR_SEYMOUR_NODE *parent, size_t childIndex, CMR_CHRMAT *matrix, CMR_CHRMAT *transpose, CMR_ELEMENT *rowsToParent, CMR_ELEMENT *columnsToParent)Creates a decomposition node as a child.Definition: seymour.c:956+CMR_ERROR CMRseymourUpdateThreeSumCreateMixedFirstChild(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation, size_t *rowsToChild, size_t *columnsToChild, size_t numChildBaseRows, size_t numChildBaseColumns, size_t extraRow1, size_t extraRow2, int8_t extraEntry)Creates mixed first child of an initialized 3-sum node.Definition: seymour.c:1500+void CMRregularityQueueAdd(DecompositionQueue *queue, DecompositionTask *task)Adds a task to a decomposition queue.Definition: seymour.c:2132+CMR_ERROR CMRseymourUpdateViolator(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SUBMAT *violator)Initialize an existing unknown decomposition node to be irregular with a violator submatrix.Definition: seymour.c:1041+CMR_ERROR CMRseymourSetNumChildren(CMR *cmr, CMR_SEYMOUR_NODE *node, size_t numChildren)Sets the number of children and allocates memory accordingly.Definition: seymour.c:935+DecompositionTask * CMRregularityQueueRemove(DecompositionQueue *queue)Removes a task from a decomposition queue.Definition: seymour.c:2122+CMR_ERROR CMRseymourUpdateSeriesParallel(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SUBMAT *reducedSubmatrix)Updates an existing unknown Seymour decomposition node to be a series-parallel node.Definition: seymour.c:1058+CMR_ERROR CMRregularityTaskCreateRoot(CMR *cmr, CMR_SEYMOUR_NODE *dec, DecompositionTask **ptask, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, clock_t startClock, double timeLimit)Creates a decomposition task for the root of the decomposition.Definition: seymour.c:2044+CMR_ERROR CMRseymourDecompose(CMR *cmr, CMR_CHRMAT *matrix, bool ternary, CMR_SEYMOUR_NODE **proot, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit)Tests ternary or binary linear matroid for regularity.Definition: seymour.c:2208+CMR_ERROR CMRregularityQueueCreate(CMR *cmr, DecompositionQueue **pqueue)Initializes a decomposition queue.Definition: seymour.c:2079+CMR_ERROR CMRregularityExtendNestedMinorSequence(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Extends an incomplete sequence of nested 3-connected minors for the matrix of a decomposition node.Definition: regularity_nested_minor_sequence.c:626+CMR_ERROR CMRregularityQueueFree(CMR *cmr, DecompositionQueue **pqueue)Frees the decomposition queue.Definition: seymour.c:2094+CMR_ERROR CMRseymourUpdateThreeSumInit(CMR *cmr, CMR_SEYMOUR_NODE *node)Initialize an existing unknown decomposition node as a 3-sum node.Definition: seymour.c:1199+CMR_ERROR CMRseymourUpdateTwoSum(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation)Initialize an existing unknown decomposition node as a 2-separation node according to the given separ...Definition: seymour.c:1080+CMR_ERROR CMRregularityNestedMinorSequenceGraphicness(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Tests each minor of the sequence of nested 3-connected minors for graphicness.Definition: regularity_graphic.c:1627+CMR_ERROR CMRseymourUpdateOneSum(CMR *cmr, CMR_SEYMOUR_NODE *node, size_t numChildren)Initialize an existing unknown decomposition node as a 1-sum with numChildren children.Definition: seymour.c:999+CMR_ERROR CMRseymourSetAttributes(CMR_SEYMOUR_NODE *node)Set regularity and (co)graphicness attributes of a decomposition tree.Definition: seymour.c:1793+CMR_ERROR CMRseymourUpdatePivots(CMR *cmr, CMR_SEYMOUR_NODE *node, size_t numPivots, size_t *pivotRows, size_t *pivotColumns, CMR_CHRMAT *matrix, CMR_CHRMAT *transpose)Initialize an existing unknown decomposition node as a pivot node according to the given arrays of pi...Definition: seymour.c:1163CMR_ERROR CMRregularityNestedMinorSequenceCographicness(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Tests each minor of the sequence of nested 3-connected minors for graphicness.Definition: regularity_graphic.c:1714-char * CMRseymourConsistency(CMR_SEYMOUR_NODE *node, bool recurse)Checks a Seymour decomposition node for consistency.-CMR_ERROR CMRseymourUpdateThreeSumCreateWideSecondChild(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation, size_t *rowsToChild, size_t *columnsToChild, size_t numChildBaseRows, size_t numChildBaseColumns, size_t extraRow, size_t extraColumn1, size_t extraColumn2, int8_t extraEntry)Creates wide second child of an initialized 3-sum node.Definition: seymour.c:1270-CMR_ERROR CMRseymourUpdateThreeSumCreateMixedSecondChild(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation, size_t *rowsToChild, size_t *columnsToChild, size_t numChildBaseRows, size_t numChildBaseColumns, size_t extraColumn1, size_t extraColumn2, int8_t extraEntry)Creates mixed second child of an initialized 3-sum node.Definition: seymour.c:1551+CMR_EXPORT CMR_ERROR CMRseymourPrintChild(CMR *cmr, CMR_SEYMOUR_NODE *child, CMR_SEYMOUR_NODE *parent, size_t childIndex, FILE *stream, size_t indent, bool printChildren, bool printParentElements, bool printMatrices, bool printGraphs, bool printReductions, bool printPivots)Prints the decomposition child to stream.Definition: seymour.c:268+CMR_ERROR CMRregularityTestCographicness(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Tests matrix for cographicness/conetwork and stores it in dec.Definition: regularity_graphic.c:1876+CMR_ERROR CMRregularityCompleteDecomposition(CMR *cmr, CMR_SEYMOUR_NODE *subtree, CMR_SEYMOUR_PARAMS *params, CMR_SEYMOUR_STATS *stats, double timeLimit)Replaces the subtree of a matroid decomposition tree by a new one.Definition: seymour.c:2229+bool CMRregularityQueueEmpty(DecompositionQueue *queue)Returns whether a queue is empty.Definition: seymour.c:2115+struct DecompositionTask DecompositionTask+CMR_ERROR CMRseymourUpdateThreeSumCreateWideSecondChild(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation, size_t *rowsToChild, size_t *columnsToChild, size_t numChildBaseRows, size_t numChildBaseColumns, size_t extraRow, size_t extraColumn1, size_t extraColumn2, int8_t extraEntry)Creates wide second child of an initialized 3-sum node.Definition: seymour.c:1353+CMR_ERROR CMRregularityTaskFree(CMR *cmr, DecompositionTask **ptask)Frees a decomposition task.Definition: seymour.c:2066+CMR_ERROR CMRseymourUpdateThreeSumCreateMixedSecondChild(CMR *cmr, CMR_SEYMOUR_NODE *node, CMR_SEPA *separation, size_t *rowsToChild, size_t *columnsToChild, size_t numChildBaseRows, size_t numChildBaseColumns, size_t extraColumn1, size_t extraColumn2, int8_t extraEntry)Creates mixed second child of an initialized 3-sum node.Definition: seymour.c:1634+CMR_EXPORT CMR_ERROR CMRseymourPrintChild(CMR *cmr, CMR_SEYMOUR_NODE *child, CMR_SEYMOUR_NODE *parent, size_t childIndex, FILE *stream, size_t indent, bool printChildren, bool printParentElements, bool printMatrices, bool printGraphs, bool printReductions, bool printPivots)Prints the decomposition child to stream.Definition: seymour.c:351CMR_ERROR CMRregularityDecomposeSeriesParallel(CMR *cmr, DecompositionTask *task, DecompositionQueue *queue)Splits off series-parallel elements from the matrix of the decomposition node.Definition: regularity_series_parallel.c:10Definition: env_internal.h:45- +Definition: graph.h:49+ + +Definition: separation.h:52+Definition: seymour_internal.h:356+bool foundNongraphicnessWhether non-graphiness was detected for some node.Definition: seymour_internal.h:359+DecompositionTask * headNext task to be processed.Definition: seymour_internal.h:357+bool foundIrregularityWhether irregularity was detected for some node.Definition: seymour_internal.h:358+bool foundNoncographicnessWhether non-cographiness was detected for some node.Definition: seymour_internal.h:360+Definition: seymour_internal.h:94+struct DecompositionTask * nextNext task in queue.Definition: seymour_internal.h:96+CMR_SEYMOUR_STATS * statsStatistics for the computation (may be NULL).Definition: seymour_internal.h:98+clock_t startClockClock for the start time.Definition: seymour_internal.h:99+CMR_SEYMOUR_NODE * nodeDecomposition node that shall be processed.Definition: seymour_internal.h:95+ -CMR_SEYMOUR_PARAMS * paramsParameters for the computation.Definition: seymour_internal.h:97-Definition: seymour_internal.h:17-CMR_GRAPH * graphGraph represented by this matrix.Definition: seymour_internal.h:52-int8_t regularityMatrix is (not) regular/totally unimodularity if positive (negative), or not determined if zero.Definition: seymour_internal.h:22-CMR_GRAPH * cographGraph represented by the transpose of this matrix.Definition: seymour_internal.h:57-CMR_ELEMENT * nestedMinorsColumnsOriginalMaps columns of nestedMinorsDense to elements of matrix.Definition: seymour_internal.h:87-size_t memMinorsMemory allocated for minors/submatrices.Definition: seymour_internal.h:48-bool * cographArcsReversedArray indicating which arcs of the cograph are reversed.Definition: seymour_internal.h:60-CMR_CHRMAT * transposeTranpose of matrix representing this node.Definition: seymour_internal.h:32- -bool testedTwoConnectedIndicates that no 1-separation exists.Definition: seymour_internal.h:21-CMR_CHRMAT * nestedMinorsTransposeTranspose of nestedMinorsMatrix.Definition: seymour_internal.h:84-size_t numMinorsNumber of minors/submatrices.Definition: seymour_internal.h:49-size_t * columnsToChildArray for mapping each column to a column of the child (if applicable).Definition: seymour_internal.h:45-size_t numChildrenNumber of child nodes.Definition: seymour_internal.h:33-size_t nestedMinorsLengthLength of sequence of nested minors.Definition: seymour_internal.h:78-int8_t cographicnessMatrix is (not) cographic/conetwork if positive (negative), or not determined if zero.Definition: seymour_internal.h:26-CMR_ELEMENT * denseColumnsOriginalMaps columns of denseMatrix to elements of matrix.Definition: seymour_internal.h:73-bool * graphArcsReversedArray indicating which arcs of the graph are reversed.Definition: seymour_internal.h:55-size_t * nestedMinorsSequenceNumColumnsNumber of columns of sequence of nested minors.Definition: seymour_internal.h:80-CMR_SEYMOUR_NODE_THREESUM_FLAG threesumFlagsType of 3-sum.Definition: seymour_internal.h:30-bool testedR10Matrix does not represent unless type indicates this.Definition: seymour_internal.h:28-CMR_GRAPH_EDGE * cographForestArray with edges of spanning forest of cograph.Definition: seymour_internal.h:58-CMR_ELEMENT * denseRowsOriginalMaps rows of denseMatrix to elements of matrix.Definition: seymour_internal.h:72-CMR_MINOR ** minorsArray of minors/submatrices containing more information.Definition: seymour_internal.h:50-size_t * nestedMinorsSequenceNumRowsNumber of rows of sequence of nested minors.Definition: seymour_internal.h:79-struct _CMR_SEYMOUR_NODE ** childrenArray of child nodes.Definition: seymour_internal.h:34-CMR_GRAPH_EDGE * graphForestArray with edges of spanning forest of graph.Definition: seymour_internal.h:53- -int8_t graphicnessMatrix is (not) graphic/network if positive (negative), or not determined if zero.Definition: seymour_internal.h:24-bool testedSeriesParallelAlready searched for series-parallel reductions.Definition: seymour_internal.h:62-size_t numColumnsLength of columnsParent.Definition: seymour_internal.h:44-size_t * nestedMinorsRowsDenseMaps rows of nested minor sequence to rows of dense.Definition: seymour_internal.h:74-size_t nestedMinorsLastGraphicLast minor in sequence of nested minors that is graphic.Definition: seymour_internal.h:90-size_t nestedMinorsLastCographicLast minor in sequence of nested minors that is cographic.Definition: seymour_internal.h:91-CMR_CHRMAT * nestedMinorsMatrixSparse support matrix that displays the sequence of nested minors. Rows and columns are permuted acco...Definition: seymour_internal.h:82-CMR_ELEMENT ** childRowsToParentArray for mapping a child index to array of child rows to elements of this node.Definition: seymour_internal.h:35-CMR_SEYMOUR_NODE_TYPE typeType of this node.Definition: seymour_internal.h:19-CMR_ELEMENT ** childColumnsToParentArray for mapping a child index to array of child columns to elements of this node.Definition: seymour_internal.h:37-CMR_GRAPH_EDGE * cographCoforestArray with edges of coforest of cograph.Definition: seymour_internal.h:59- -size_t numSeriesParallelReductionsLength of reductions.Definition: seymour_internal.h:64-DenseBinaryMatrix * denseMatrixDense support matrix for nested minors search. Rows and columns are not permuted, but pivots are appl...Definition: seymour_internal.h:70- -CMR_ELEMENT * nestedMinorsRowsOriginalMaps rows of nestedMinorsMatrix to elements of matrix.Definition: seymour_internal.h:85-size_t * rowsToChildArray for mapping each row to a row of the child (if applicable).Definition: seymour_internal.h:41-size_t * nestedMinorsColumnsDenseMaps columns of nested minor sequence to columns of dense.Definition: seymour_internal.h:75-bool isTernaryIndicates whether this node belongs to a ternary matrix.Definition: seymour_internal.h:20-CMR_GRAPH_EDGE * graphCoforestArray with edges of coforest of graph.Definition: seymour_internal.h:54-CMR_CHRMAT * matrixMatrix representing this node.Definition: seymour_internal.h:31-CMR_SP_REDUCTION * seriesParallelReductionsArray of series-parallel reductions.Definition: seymour_internal.h:63+size_t * pivotColumnsColumns of pivots.Definition: seymour_internal.h:67+Definition: seymour_internal.h:16+CMR_GRAPH * graphGraph represented by this matrix.Definition: seymour_internal.h:51+int8_t regularityMatrix is (not) regular/totally unimodularity if positive (negative), or not determined if zero.Definition: seymour_internal.h:21+CMR_GRAPH * cographGraph represented by the transpose of this matrix.Definition: seymour_internal.h:56+CMR_ELEMENT * nestedMinorsColumnsOriginalMaps columns of nestedMinorsDense to elements of matrix.Definition: seymour_internal.h:86+size_t memMinorsMemory allocated for minors/submatrices.Definition: seymour_internal.h:47+bool * cographArcsReversedArray indicating which arcs of the cograph are reversed.Definition: seymour_internal.h:59+CMR_SEYMOUR_THREESUM_FLAG threesumFlagsType of 3-sum.Definition: seymour_internal.h:29+CMR_CHRMAT * transposeTranpose of matrix representing this node.Definition: seymour_internal.h:31+ +bool testedTwoConnectedIndicates that no 1-separation exists.Definition: seymour_internal.h:20+CMR_CHRMAT * nestedMinorsTransposeTranspose of nestedMinorsMatrix.Definition: seymour_internal.h:83+size_t numMinorsNumber of minors/submatrices.Definition: seymour_internal.h:48+size_t * columnsToChildArray for mapping each column to a column of the child (if applicable).Definition: seymour_internal.h:44+size_t numChildrenNumber of child nodes.Definition: seymour_internal.h:32+size_t nestedMinorsLengthLength of sequence of nested minors.Definition: seymour_internal.h:77+int8_t cographicnessMatrix is (not) cographic/conetwork if positive (negative), or not determined if zero.Definition: seymour_internal.h:25+CMR_ELEMENT * denseColumnsOriginalMaps columns of denseMatrix to elements of matrix.Definition: seymour_internal.h:72+bool * graphArcsReversedArray indicating which arcs of the graph are reversed.Definition: seymour_internal.h:54+size_t * nestedMinorsSequenceNumColumnsNumber of columns of sequence of nested minors.Definition: seymour_internal.h:79+bool testedR10Matrix does not represent unless type indicates this.Definition: seymour_internal.h:27+CMR_GRAPH_EDGE * cographForestArray with edges of spanning forest of cograph.Definition: seymour_internal.h:57+CMR_ELEMENT * denseRowsOriginalMaps rows of denseMatrix to elements of matrix.Definition: seymour_internal.h:71+CMR_MINOR ** minorsArray of minors/submatrices containing more information.Definition: seymour_internal.h:49+size_t * nestedMinorsSequenceNumRowsNumber of rows of sequence of nested minors.Definition: seymour_internal.h:78+struct _CMR_SEYMOUR_NODE ** childrenArray of child nodes.Definition: seymour_internal.h:33+CMR_GRAPH_EDGE * graphForestArray with edges of spanning forest of graph.Definition: seymour_internal.h:52+ +int8_t graphicnessMatrix is (not) graphic/network if positive (negative), or not determined if zero.Definition: seymour_internal.h:23+bool testedSeriesParallelAlready searched for series-parallel reductions.Definition: seymour_internal.h:61+size_t numColumnsLength of columnsParent.Definition: seymour_internal.h:43+size_t * nestedMinorsRowsDenseMaps rows of nested minor sequence to rows of dense.Definition: seymour_internal.h:73+size_t nestedMinorsLastGraphicLast minor in sequence of nested minors that is graphic.Definition: seymour_internal.h:89+size_t nestedMinorsLastCographicLast minor in sequence of nested minors that is cographic.Definition: seymour_internal.h:90+CMR_CHRMAT * nestedMinorsMatrixSparse support matrix that displays the sequence of nested minors. Rows and columns are permuted acco...Definition: seymour_internal.h:81+CMR_ELEMENT ** childRowsToParentArray for mapping a child index to array of child rows to elements of this node.Definition: seymour_internal.h:34+CMR_SEYMOUR_NODE_TYPE typeType of this node.Definition: seymour_internal.h:18+CMR_ELEMENT ** childColumnsToParentArray for mapping a child index to array of child columns to elements of this node.Definition: seymour_internal.h:36+CMR_GRAPH_EDGE * cographCoforestArray with edges of coforest of cograph.Definition: seymour_internal.h:58+ +size_t numSeriesParallelReductionsLength of reductions.Definition: seymour_internal.h:63+DenseBinaryMatrix * denseMatrixDense support matrix for nested minors search. Rows and columns are not permuted, but pivots are appl...Definition: seymour_internal.h:69+ +CMR_ELEMENT * nestedMinorsRowsOriginalMaps rows of nestedMinorsMatrix to elements of matrix.Definition: seymour_internal.h:84+size_t * rowsToChildArray for mapping each row to a row of the child (if applicable).Definition: seymour_internal.h:40+size_t * nestedMinorsColumnsDenseMaps columns of nested minor sequence to columns of dense.Definition: seymour_internal.h:74+bool isTernaryIndicates whether this node belongs to a ternary matrix.Definition: seymour_internal.h:19+CMR_GRAPH_EDGE * graphCoforestArray with edges of coforest of graph.Definition: seymour_internal.h:53+CMR_CHRMAT * matrixMatrix representing this node.Definition: seymour_internal.h:30+CMR_SP_REDUCTION * seriesParallelReductionsArray of series-parallel reductions.Definition: seymour_internal.h:62size_t * pivotColumnsColumns of pivots.Definition: seymour_internal.h:66
diff --git a/structCMR__REGULAR__PARAMS-members.html b/structCMR__REGULAR__PARAMS-members.html index 4380cc10..20168299 100644 --- a/structCMR__REGULAR__PARAMS-members.html +++ b/structCMR__REGULAR__PARAMS-members.html @@ -79,13 +79,7 @@This is the complete list of members for CMR_REGULAR_PARAMS, including all inherited members.
diff --git a/structCMR__REGULAR__PARAMS.html b/structCMR__REGULAR__PARAMS.html index 389f8e47..84605ebf 100644 --- a/structCMR__REGULAR__PARAMS.html +++ b/structCMR__REGULAR__PARAMS.html @@ -84,161 +84,22 @@Public Attributes
bool directGraphicness Whether to use fast graphicness routines; default: true. More...bool seriesParallel Whether to allow series-parallel operations in the decomposition tree; default: true. More...bool planarityCheck Whether minors identified as graphic should still be checked for cographicness; default: false. More...int treeFlags Flags controlling the decomposition algorithm. See
- More...bool threeSumPivotChildren Whether pivots for 3-sums shall be applied such that the matrix contains both child matrices as submatrices, if possible. More... int threeSumStrategy Whether to perform pivots to change the rank distribution, and how to construct the children. More... CMR_DEC_CONSTRUCT graphs Which (co)graphs to construct; default: CMR_DEC_CONSTRUCT_NONE. More... CMR_SEYMOUR_PARAMS seymour Member Data Documentation
- -◆ directGraphicness
+ +◆ seymour
- -- bool CMR_REGULAR_PARAMS::directGraphicness +CMR_SEYMOUR_PARAMS CMR_REGULAR_PARAMS::seymour --Whether to use fast graphicness routines; default:
- -true.◆ graphs
- --- ---
-- -CMR_DEC_CONSTRUCT CMR_REGULAR_PARAMS::graphs -- --Which (co)graphs to construct; default: CMR_DEC_CONSTRUCT_NONE.
- -◆ planarityCheck
- --- ---
-- -bool CMR_REGULAR_PARAMS::planarityCheck -- --Whether minors identified as graphic should still be checked for cographicness; default:
- -false.◆ seriesParallel
- --- ---
-- -bool CMR_REGULAR_PARAMS::seriesParallel -- --Whether to allow series-parallel operations in the decomposition tree; default:
- -true.◆ threeSumPivotChildren
- --- ---
-- -bool CMR_REGULAR_PARAMS::threeSumPivotChildren -- --Whether pivots for 3-sums shall be applied such that the matrix contains both child matrices as submatrices, if possible.
- -◆ threeSumStrategy
- --- ---
-- -int CMR_REGULAR_PARAMS::threeSumStrategy -- --Whether to perform pivots to change the rank distribution, and how to construct the children.
-The value is a bit-wise or of three decisions. The first decision is that of the rank distribution:
-
-
- CMR_MATROID_DEC_THREESUM_FLAG_NO_PIVOTS to not change the rank distribution (default), or -
- CMR_MATROID_DEC_THREESUM_FLAG_DISTRIBUTED_RANKS to enforce distributed ranks (1 + 1), or -
- CMR_MATROID_DEC_THREESUM_FLAG_CONCENTRATED_RANK to enforce concentrated ranks (2 + 0). -
The second decision determines the layout of the first child matrix:
-
-
- CMR_MATROID_DEC_THREESUM_FLAG_FIRST_WIDE for a wide first child (default) in case of distributed ranks, or -
- CMR_MATROID_DEC_THREESUM_FLAG_FIRST_TALL for a tall first child in that case. -
- CMR_MATROID_DEC_THREESUM_FLAG_FIRST_MIXED for a mixed first child (default) in case of concentrated ranks, or -
- CMR_MATROID_DEC_THREESUM_FLAG_FIRST_ALLREPR for a first child with all representing rows in that case. -
Similarly, the third decision determines the layout of the second child matrix:
-
-
- CMR_MATROID_DEC_THREESUM_FLAG_SECOND_WIDE for a wide second child (default) in case of distributed ranks, or -
- CMR_MATROID_DEC_THREESUM_FLAG_SECOND_TALL for a tall second child in that case. -
- CMR_MATROID_DEC_THREESUM_FLAG_SECOND_MIXED for a mixed second child (default) in case of concentrated ranks, or -
- CMR_MATROID_DEC_THREESUM_FLAG_SECOND_ALLREPR for a first second with all representing rows in that case. -
- See also
- Decomposition of matroids for a description of these layouts.
A decomposition as described by Seymour can be selected via CMR_MATROID_DEC_THREESUM_FLAG_SEYMOUR. A decomposition as used by Truemper can be selected via CMR_MATROID_DEC_THREESUM_FLAG_TRUEMPER. The default is to not carry out any pivots and choose Seymour's or Truemper's definition depending on the rank distribution.
- -◆ treeFlags
- ----
-- -int CMR_REGULAR_PARAMS::treeFlags -- -Flags controlling the decomposition algorithm. See
-
-Whether to compute a complete decomposition tree (even if already non-regular; default:
-false.
The documentation for this struct was generated from the following file:-
diff --git a/structCMR__REGULAR__STATS-members.html b/structCMR__REGULAR__STATS-members.html
index 7e19480d..0aa8f9dd 100644
--- a/structCMR__REGULAR__STATS-members.html
+++ b/structCMR__REGULAR__STATS-members.html
@@ -79,19 +79,7 @@
This is the complete list of members for CMR_REGULAR_STATS, including all inherited members.
Public Attributes
uint32_t totalCount double totalTime CMR_SP_STATISTICS seriesParallel CMR_GRAPHIC_STATISTICS graphic CMR_NETWORK_STATISTICS network CMR_CAMION_STATISTICS camion uint32_t sequenceExtensionCount double sequenceExtensionTime uint32_t sequenceGraphicCount double sequenceGraphicTime uint32_t enumerationCount double enumerationTime uint32_t enumerationCandidatesCount CMR_SEYMOUR_STATS seymour Detailed Description
Statistics for regular matroid recognition algorithm.
Member Data Documentation
- -◆ camion
+ +◆ seymour
- -- CMR_CAMION_STATISTICS CMR_REGULAR_STATS::camion +CMR_SEYMOUR_STATS CMR_REGULAR_STATS::seymour --Statistics for Camion signing.
- -◆ enumerationCandidatesCount
- --- ---
-- -uint32_t CMR_REGULAR_STATS::enumerationCandidatesCount ---Number of enumerated candidates for 3-separations.
- -◆ enumerationCount
- --- ---
-- -uint32_t CMR_REGULAR_STATS::enumerationCount ---Number of calls to enumeration algorithm for candidate 3-separations.
- -◆ enumerationTime
- --- ---
-- -double CMR_REGULAR_STATS::enumerationTime ---Time of enumeration of candidate 3-separations.
- -◆ graphic
- --- ---
-- -CMR_GRAPHIC_STATISTICS CMR_REGULAR_STATS::graphic ---Statistics for direct (co)graphic checks.
- -◆ network
- --- ---
-- -CMR_NETWORK_STATISTICS CMR_REGULAR_STATS::network ---Statistics for direct (co)network checks.
- -◆ sequenceExtensionCount
- --- ---
-- -uint32_t CMR_REGULAR_STATS::sequenceExtensionCount ---Number of extensions of sequences of nested minors.
- -◆ sequenceExtensionTime
- --- ---
-- -double CMR_REGULAR_STATS::sequenceExtensionTime ---Time of extensions of sequences of nested minors.
- -◆ sequenceGraphicCount
- --- ---
-- -uint32_t CMR_REGULAR_STATS::sequenceGraphicCount ---Number (co)graphicness tests applied to sequence of nested minors.
- -◆ sequenceGraphicTime
- --- ---
-- -double CMR_REGULAR_STATS::sequenceGraphicTime ---Time of (co)graphicness tests applied to sequence of nested minors.
- -◆ seriesParallel
- --- ---
-- -CMR_SP_STATISTICS CMR_REGULAR_STATS::seriesParallel ---Statistics for series-parallel algorithm.
- -◆ totalCount
- --- ---
-- -uint32_t CMR_REGULAR_STATS::totalCount ---Total number of invocations.
- -◆ totalTime
- --diff --git a/structCMR__SEYMOUR__PARAMS-members.html b/structCMR__SEYMOUR__PARAMS-members.html new file mode 100644 index 00000000..c44dc0dd --- /dev/null +++ b/structCMR__SEYMOUR__PARAMS-members.html @@ -0,0 +1,100 @@ + + + + + + + + +--
-- -double CMR_REGULAR_STATS::totalTime --Total time of all invocations.
+Statistics for Seymour decomposition computations.
CMR: Member List + + + + + + + + + + + + +++++ + + + + + + + ++ +
++ + +
+ +CMR + 1.3.0 ++++ + ++ ++ +++++CMR_SEYMOUR_PARAMS Member List+ ++ +This is the complete list of members for CMR_SEYMOUR_PARAMS, including all inherited members.
+
+Generated by
1.9.1
+
+
+
diff --git a/structCMR__SEYMOUR__PARAMS.html b/structCMR__SEYMOUR__PARAMS.html
new file mode 100644
index 00000000..29f43df9
--- /dev/null
+++ b/structCMR__SEYMOUR__PARAMS.html
@@ -0,0 +1,350 @@
+
+
+
+
+
+
+
+
+CMR: CMR_SEYMOUR_PARAMS Struct Reference + + + + + + + + + + + + +++++ + + + + + + + ++ +
++ + ++ +CMR + 1.3.0 ++++ + ++ ++ ++ ++++CMR_SEYMOUR_PARAMS Struct Reference+ ++ +Parameters for Seymour decomposition algorithm. + More...
+ +
+#include <seymour.h>+
++Public Attributes
bool stopWhenIrregular Whether to stop decomposing once irregularity is determined. More... bool stopWhenNongraphic Whether to stop decomposing once non-graphicness (or being non-network) is determined. More... bool stopWhenNoncographic Whether to stop decomposing once non-cographicness (or being non-conetwork) is determined. More... bool stopWhenNeitherGraphicNorCoGraphic Whether to stop decomposing once non-graphicness and non-cographicness (or not being network and not being conetwork) is determined. More... bool seriesParallel Whether to allow series-parallel operations in the decomposition tree; default: true. More...bool planarityCheck Whether minors identified as graphic should still be checked for cographicness; default: false. More...bool directGraphicness Whether to use fast graphicness routines; default: true. More...bool preferGraphicness Whether to first test for (co)graphicness (or being (co)network) before applying series-parallel reductions. More... bool threeSumPivotChildren Whether pivots for 3-sums shall be applied such that the matrix contains both child matrices as submatrices, if possible. More... int threeSumStrategy Whether to perform pivots to change the rank distribution, and how to construct the children. More... bool constructLeafGraphs Whether to construct (co)graphs for all leaf nodes that are (co)graphic or (co)network. More... bool constructAllGraphs Whether to construct (co)graphs for all nodes that are (co)graphic or (co)network. More... Detailed Description
+Parameters for Seymour decomposition algorithm.
+Member Data Documentation
+ +◆ constructAllGraphs
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::constructAllGraphs ++ ++Whether to construct (co)graphs for all nodes that are (co)graphic or (co)network.
+ +◆ constructLeafGraphs
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::constructLeafGraphs ++ ++Whether to construct (co)graphs for all leaf nodes that are (co)graphic or (co)network.
+ +◆ directGraphicness
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::directGraphicness ++ ++Whether to use fast graphicness routines; default:
+ +true.◆ planarityCheck
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::planarityCheck ++ ++Whether minors identified as graphic should still be checked for cographicness; default:
+ +false.◆ preferGraphicness
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::preferGraphicness ++ ++Whether to first test for (co)graphicness (or being (co)network) before applying series-parallel reductions.
+ +◆ seriesParallel
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::seriesParallel ++ ++Whether to allow series-parallel operations in the decomposition tree; default:
+ +true.◆ stopWhenIrregular
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::stopWhenIrregular ++ ++Whether to stop decomposing once irregularity is determined.
+ +◆ stopWhenNeitherGraphicNorCoGraphic
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::stopWhenNeitherGraphicNorCoGraphic ++ ++Whether to stop decomposing once non-graphicness and non-cographicness (or not being network and not being conetwork) is determined.
+ +◆ stopWhenNoncographic
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::stopWhenNoncographic ++ ++Whether to stop decomposing once non-cographicness (or being non-conetwork) is determined.
+ +◆ stopWhenNongraphic
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::stopWhenNongraphic ++ ++Whether to stop decomposing once non-graphicness (or being non-network) is determined.
+ +◆ threeSumPivotChildren
+ +++ +++
++ +bool CMR_SEYMOUR_PARAMS::threeSumPivotChildren ++ ++Whether pivots for 3-sums shall be applied such that the matrix contains both child matrices as submatrices, if possible.
+ +◆ threeSumStrategy
+ +++++
++ +int CMR_SEYMOUR_PARAMS::threeSumStrategy ++ ++Whether to perform pivots to change the rank distribution, and how to construct the children.
+The value is a bit-wise or of three decisions. The first decision is that of the rank distribution:
-
+
- CMR_SEYMOUR_THREESUM_FLAG_NO_PIVOTS to not change the rank distribution (default), or +
- CMR_SEYMOUR_THREESUM_FLAG_DISTRIBUTED_RANKS to enforce distributed ranks (1 + 1), or +
- CMR_SEYMOUR_THREESUM_FLAG_CONCENTRATED_RANK to enforce concentrated ranks (2 + 0). +
The second decision determines the layout of the first child matrix:
-
+
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_WIDE for a wide first child (default) in case of distributed ranks, or +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_TALL for a tall first child in that case. +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_MIXED for a mixed first child (default) in case of concentrated ranks, or +
- CMR_SEYMOUR_THREESUM_FLAG_FIRST_ALLREPR for a first child with all representing rows in that case. +
Similarly, the third decision determines the layout of the second child matrix:
-
+
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_WIDE for a wide second child (default) in case of distributed ranks, or +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_TALL for a tall second child in that case. +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_MIXED for a mixed second child (default) in case of concentrated ranks, or +
- CMR_SEYMOUR_THREESUM_FLAG_SECOND_ALLREPR for a first second with all representing rows in that case. +
- See also
- Decomposition of matroids for a description of these layouts.
A decomposition as described by Seymour can be selected via CMR_SEYMOUR_THREESUM_FLAG_SEYMOUR. A decomposition as used by Truemper can be selected via CMR_SEYMOUR_THREESUM_FLAG_TRUEMPER. The default is to not carry out any pivots and choose Seymour's or Truemper's definition depending on the rank distribution.
+ +
The documentation for this struct was generated from the following file:-
+
- /home/runner/work/cmr/cmr/include/cmr/seymour.h +
+Generated by 1.9.1
+
+
+
diff --git a/structCMR__SEYMOUR__STATS-members.html b/structCMR__SEYMOUR__STATS-members.html
new file mode 100644
index 00000000..4fcfed5e
--- /dev/null
+++ b/structCMR__SEYMOUR__STATS-members.html
@@ -0,0 +1,100 @@
+
+
+
+
+
+
+
+
+CMR: Member List + + + + + + + + + + + + +++++ + + + + + + + ++ +
++ + ++ +CMR + 1.3.0 ++++ + ++ ++ +++++CMR_SEYMOUR_STATS Member List+ ++ +This is the complete list of members for CMR_SEYMOUR_STATS, including all inherited members.
+
+Generated by 1.9.1
+
+
+
diff --git a/structCMR__SEYMOUR__STATS.html b/structCMR__SEYMOUR__STATS.html
new file mode 100644
index 00000000..27c00cf6
--- /dev/null
+++ b/structCMR__SEYMOUR__STATS.html
@@ -0,0 +1,307 @@
+
+
+
+
+
+
+
+
+CMR: CMR_SEYMOUR_STATS Struct Reference + + + + + + + + + + + + +++++ + + + + + + + ++ +
++ + ++ +CMR + 1.3.0 ++++ + ++ ++ ++ ++++CMR_SEYMOUR_STATS Struct Reference+ ++ +Statistics for Seymour decomposition algorithm. + More...
+ +
+#include <seymour.h>+
++Public Attributes
uint32_t totalCount double totalTime CMR_SP_STATISTICS seriesParallel CMR_GRAPHIC_STATISTICS graphic CMR_NETWORK_STATISTICS network uint32_t sequenceExtensionCount double sequenceExtensionTime uint32_t sequenceGraphicCount double sequenceGraphicTime uint32_t enumerationCount double enumerationTime uint32_t enumerationCandidatesCount Detailed Description
+Statistics for Seymour decomposition algorithm.
+Member Data Documentation
+ +◆ enumerationCandidatesCount
+ +++ +++
++ +uint32_t CMR_SEYMOUR_STATS::enumerationCandidatesCount +++Number of enumerated candidates for 3-separations.
+ +◆ enumerationCount
+ +++ +++
++ +uint32_t CMR_SEYMOUR_STATS::enumerationCount +++Number of calls to enumeration algorithm for candidate 3-separations.
+ +◆ enumerationTime
+ +++ +++
++ +double CMR_SEYMOUR_STATS::enumerationTime +++Time of enumeration of candidate 3-separations.
+ +◆ graphic
+ +++ +++
++ +CMR_GRAPHIC_STATISTICS CMR_SEYMOUR_STATS::graphic +++Statistics for direct (co)graphic checks.
+ +◆ network
+ +++ +++
++ +CMR_NETWORK_STATISTICS CMR_SEYMOUR_STATS::network +++Statistics for direct (co)network checks.
+ +◆ sequenceExtensionCount
+ +++ +++
++ +uint32_t CMR_SEYMOUR_STATS::sequenceExtensionCount +++Number of extensions of sequences of nested minors.
+ +◆ sequenceExtensionTime
+ +++ +++
++ +double CMR_SEYMOUR_STATS::sequenceExtensionTime +++Time of extensions of sequences of nested minors.
+ +◆ sequenceGraphicCount
+ +++ +++
++ +uint32_t CMR_SEYMOUR_STATS::sequenceGraphicCount +++Number (co)graphicness tests applied to sequence of nested minors.
+ +◆ sequenceGraphicTime
+ +++ +++
++ +double CMR_SEYMOUR_STATS::sequenceGraphicTime +++Time of (co)graphicness tests applied to sequence of nested minors.
+ +◆ seriesParallel
+ +++ +++
++ +CMR_SP_STATISTICS CMR_SEYMOUR_STATS::seriesParallel +++Statistics for series-parallel algorithm.
+ +◆ totalCount
+ +++ +++
++ +uint32_t CMR_SEYMOUR_STATS::totalCount +++Total number of invocations.
+ +◆ totalTime
+ +++++
++ +double CMR_SEYMOUR_STATS::totalTime +++Total time of all invocations.
+ +
The documentation for this struct was generated from the following file:-
+
- /home/runner/work/cmr/cmr/include/cmr/seymour.h +
+Generated by 1.9.1
+
+
+
diff --git a/structCMR__TU__PARAMS-members.html b/structCMR__TU__PARAMS-members.html
index 30de82db..a1272302 100644
--- a/structCMR__TU__PARAMS-members.html
+++ b/structCMR__TU__PARAMS-members.html
@@ -80,8 +80,9 @@
This is the complete list of members for CMR_TU_PARAMS, including all inherited members.
algorithm CMR_TU_PARAMS directCamion CMR_TU_PARAMS regular CMR_TU_PARAMS camionFirst CMR_TU_PARAMS seymour CMR_TU_PARAMS ternary CMR_TU_PARAMS
diff --git a/structCMR__TU__PARAMS.html b/structCMR__TU__PARAMS.html index 46283b0b..a2780ea0 100644 --- a/structCMR__TU__PARAMS.html +++ b/structCMR__TU__PARAMS.html @@ -87,12 +87,15 @@CMR_TU_ALGORITHM algorithm Algorithm to use. More... bool directCamion Whether to directly test signing of matrix (default: false). More...CMR_REGULAR_PARAMS regular Parameters for regularity test. More... CMR_SEYMOUR_PARAMS seymour Parameters for testing via Seymour decomposition. More... bool ternary Whether to create a ternary Seymour decomposition tree (default: true). More...bool camionFirst If ternaryisfalse, then then whether to run the Camion test first. More...Member Data Documentation
@@ -111,35 +114,51 @@-
◆ directCamion
+ +◆ camionFirst
- -- bool CMR_TU_PARAMS::directCamion +bool CMR_TU_PARAMS::camionFirst -Whether to directly test signing of matrix (default:
+false).If
ternaryisfalse, then then whether to run the Camion test first.◆ regular
+ +◆ seymour
+ +- CMR_REGULAR_PARAMS CMR_TU_PARAMS::regular +CMR_SEYMOUR_PARAMS CMR_TU_PARAMS::seymour -+Parameters for regularity test.
+Parameters for testing via Seymour decomposition.
+ +◆ ternary
+ ++diff --git a/structCMR__TU__STATS-members.html b/structCMR__TU__STATS-members.html index 2551d2c7..9a3e0b1f 100644 --- a/structCMR__TU__STATS-members.html +++ b/structCMR__TU__STATS-members.html @@ -79,13 +79,14 @@++
++ +bool CMR_TU_PARAMS::ternary ++ +Whether to create a ternary Seymour decomposition tree (default:
true).This is the complete list of members for CMR_TU_STATS, including all inherited members.
diff --git a/structCMR__TU__STATS.html b/structCMR__TU__STATS.html index 9c6b61f7..126a2ac1 100644 --- a/structCMR__TU__STATS.html +++ b/structCMR__TU__STATS.html @@ -87,8 +87,10 @@Public Attributes
CMR_REGULAR_STATS decomposition CMR_SEYMOUR_STATS seymour CMR_CAMION_STATISTICS camion uint32_t enumerationRowSubsets uint32_t enumerationColumnSubsets Detailed Description
Statistics for recognition algorithm for totally unimodular matrices.
Member Data Documentation
- -◆ decomposition
+ +◆ camion
@@ -208,6 +210,21 @@- CMR_REGULAR_STATS CMR_TU_STATS::decomposition +CMR_CAMION_STATISTICS CMR_TU_STATS::camion -Statistics for regular matroid decomposition algorithm.
+Statistics for Camion signing.
Total time of partition algorithm.
+ + + +◆ seymour
+ ++++
++ +CMR_SEYMOUR_STATS CMR_TU_STATS::seymour ++Statistics for Seymour decomposition computation.
+
The documentation for this struct was generated from the following file:-
diff --git a/structClonePair.html b/structClonePair.html
index 86c39e74..167c25bd 100644
--- a/structClonePair.html
+++ b/structClonePair.html
@@ -79,6 +79,9 @@
- /home/runner/work/cmr/cmr/src/cmr/seymour_internal.h diff --git a/structDecompositionTask-members.html b/structDecompositionTask-members.html index 2dbce36f..1dc8c0be 100644 --- a/structDecompositionTask-members.html +++ b/structDecompositionTask-members.html @@ -81,9 +81,9 @@
- /home/runner/work/cmr/cmr/src/cmr/seymour_internal.h
- CMRtuTest() tests a matrix for being totally unimodular. +
- CMRtuTest() tests a matrix for being totally unimodular.
ClonePair Struct Reference+ +Pair of a given Seymour decomposition node and its clone. + More...
-Public Attributes
CMR_SEYMOUR_NODE * clone Member Data Documentation
+Detailed Description
+Pair of a given Seymour decomposition node and its clone.
+Member Data Documentation
◆ clone
diff --git a/structDecompositionQueue.html b/structDecompositionQueue.html index 2b2d2b6f..b96b5256 100644 --- a/structDecompositionQueue.html +++ b/structDecompositionQueue.html @@ -80,7 +80,7 @@-
+#include <regularity_internal.h>#include <seymour_internal.h>Public Attributes
regularity_internal.h +
-
+#include <regularity_internal.h>#include <seymour_internal.h>Public Attributes
struct DecompositionTask * next Next task in queue. More... CMR_REGULAR_PARAMS * params Parameters for the computation. More... CMR_REGULAR_STATS * stats Statistics for the computation (may be NULL). More...CMR_SEYMOUR_PARAMS * params Parameters for the computation. More... CMR_SEYMOUR_STATS * stats Statistics for the computation (may be NULL). More...clock_t startClock Clock for the start time. More... -
◆ params
+ +◆ params
- CMR_REGULAR_PARAMS* DecompositionTask::params +CMR_SEYMOUR_PARAMS* DecompositionTask::params @@ -168,14 +168,14 @@-
◆ stats
+ +◆ stats
- CMR_REGULAR_STATS* DecompositionTask::stats +CMR_SEYMOUR_STATS* DecompositionTask::stats @@ -201,7 +201,7 @@diff --git a/struct__CMR__SEYMOUR__NODE-members.html b/struct__CMR__SEYMOUR__NODE-members.html index 8a054c92..af95afbe 100644 --- a/struct__CMR__SEYMOUR__NODE-members.html +++ b/struct__CMR__SEYMOUR__NODE-members.html @@ -125,7 +125,7 @@regularity_internal.h +
testedR10 _CMR_SEYMOUR_NODE testedSeriesParallel _CMR_SEYMOUR_NODE testedTwoConnected _CMR_SEYMOUR_NODE threesumFlags _CMR_SEYMOUR_NODE threesumFlags _CMR_SEYMOUR_NODE transpose _CMR_SEYMOUR_NODE type _CMR_SEYMOUR_NODE used _CMR_SEYMOUR_NODE bool testedR10 Matrix does not represent \( R_{10} \) unless typeindicates this. More...CMR_SEYMOUR_NODE_THREESUM_FLAG threesumFlags Type of 3-sum. More... CMR_SEYMOUR_THREESUM_FLAG threesumFlags Type of 3-sum. More... CMR_CHRMAT * matrix Matrix representing this node. More... -
◆ threesumFlags
+ +◆ threesumFlags
diff --git a/tu_8c.html b/tu_8c.html index bada8e9b..08f380a5 100644 --- a/tu_8c.html +++ b/tu_8c.html @@ -78,6 +78,7 @@- CMR_SEYMOUR_NODE_THREESUM_FLAG _CMR_SEYMOUR_NODE::threesumFlags +CMR_SEYMOUR_THREESUM_FLAG _CMR_SEYMOUR_NODE::threesumFlags diff --git a/tu.html b/tu.html index ec9a6a2b..6d13b3f7 100644 --- a/tu.html +++ b/tu.html @@ -117,7 +117,7 @@C Interface
The corresponding function in the library is
-
-
and is defined in tu.h. Its parameters also allow to choose one of the enumeration algorithms with exponential running time instead of the decomposition algorithm.
@@ -87,8 +88,8 @@tu.c File Reference#include "matrix_internal.h"
#include "block_decomposition.h"
#include "camion_internal.h"
-#include "regularity_internal.h"
#include "hereditary_property.h"
+#include "seymour_internal.h"
#include <stdlib.h>
#include <assert.h>
#include <time.h>
@@ -99,6 +100,11 @@Data for enumeration. More... +
+Macros
#define CMR_DEBUG /* Uncomment to debug this file. */
+Functions
CMR_ERROR CMRtuParamsInit (CMR_TU_PARAMS *params) static CMR_ERROR tuPartition (CMR *cmr, CMR_CHRMAT *matrix, bool transposed, bool *pisTotallyUnimodular, CMR_TU_STATS *stats, double timeLimit) Partition test based on Ghouila-Houri. More... CMR_ERROR CMRtuTest (CMR *cmr, CMR_CHRMAT *matrix, bool *pisTotallyUnimodular, CMR_SEYMOUR_NODE **pdec, CMR_SUBMAT **psubmatrix, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit) Tests a matrix \( M \) for being totally unimodular. More... CMR_ERROR CMRtuTest (CMR *cmr, CMR_CHRMAT *matrix, bool *pisTotallyUnimodular, CMR_SEYMOUR_NODE **proot, CMR_SUBMAT **psubmatrix, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit) Tests a matrix \( M \) for being totally unimodular. More... CMR_ERROR CMRtuCompleteDecomposition (CMR *cmr, CMR_SEYMOUR_NODE *dec, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit) Completes a subtree of an existing decomposition tree. More... Macro Definition Documentation
+ +◆ CMR_DEBUG
+ ++++
++ +#define CMR_DEBUG /* Uncomment to debug this file. */ ++ ++Function Documentation
◆ CMRtuCompleteDecomposition()
@@ -295,8 +316,8 @@-
◆ CMRtuTest()
+ +◆ CMRtuTest()
@@ -323,7 +344,7 @@CMR_SEYMOUR_NODE ** -pdec, +proot, @@ -366,7 +387,7 @@ cmr
CMR environment matrix Matrix \( M \). pisTotallyUnimodular Pointer for storing whether \( M \) is totally unimodular. pdec Pointer for storing the decomposition tree (may be NULL).proot Pointer for storing the decomposition tree (may be NULL).psubmatrix Pointer for storing a submatrix with non-ternary determinant (may be NULL).params Parameters for the computation (may be NULLfor defaults).stats Statistics for the computation (may be NULL).CMR_EXPORT CMR_ERROR CMRtuStatsPrint (FILE *stream, CMR_TU_STATS *stats, const char *prefix) Prints statistics for recognition algorithm for totally unimodular matrices. More... CMR_EXPORT CMR_ERROR CMRtuTest (CMR *cmr, CMR_CHRMAT *matrix, bool *pisTotallyUnimodular, CMR_SEYMOUR_NODE **pdec, CMR_SUBMAT **psubmatrix, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit) Tests a matrix \( M \) for being totally unimodular. More... CMR_EXPORT CMR_ERROR CMRtuTest (CMR *cmr, CMR_CHRMAT *matrix, bool *pisTotallyUnimodular, CMR_SEYMOUR_NODE **proot, CMR_SUBMAT **psubmatrix, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit) Tests a matrix \( M \) for being totally unimodular. More... CMR_EXPORT CMR_ERROR CMRtuCompleteDecomposition (CMR *cmr, CMR_SEYMOUR_NODE *dec, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit) Completes a subtree of an existing decomposition tree. More... -
◆ CMRtuTest()
+ +◆ CMRtuTest()
@@ -340,7 +340,7 @@CMR_SEYMOUR_NODE ** -pdec, +proot, @@ -383,7 +383,7 @@ cmr
CMR environment matrix Matrix \( M \). pisTotallyUnimodular Pointer for storing whether \( M \) is totally unimodular. pdec Pointer for storing the decomposition tree (may be NULL).proot Pointer for storing the decomposition tree (may be NULL).psubmatrix Pointer for storing a submatrix with non-ternary determinant (may be NULL).params Parameters for the computation (may be NULLfor defaults).stats Statistics for the computation (may be NULL).Testing whether a matrix is Camion-signed.Basic functionality of the software library.Functionality for sparse matrices.+Recognition of regular matrices.-Definition: env_internal.h:45- + +Definition: regular.h:56- -Definition: tu.h:29+bool directCamionWhether to directly test signing of matrix (default: false).Definition: tu.h:31+bool camionFirstIf ternary is false, then then whether to run the Camion test first.Definition: tu.h:33-CMR_SEYMOUR_PARAMS seymourParameters for testing via Seymour decomposition.Definition: tu.h:31- - - - - - - -Statistics for recognition algorithm for totally unimodular matrices.Definition: tu.h:51+Definition: seymour_internal.h:17+bool ternaryWhether to create a ternary Seymour decomposition tree (default: true).Definition: tu.h:32+ + + + + + + + +Statistics for recognition algorithm for totally unimodular matrices.Definition: tu.h:52Definition: seymour_internal.h:16-CMR_EXPORT CMR_ERROR CMRtuParamsInit(CMR_TU_PARAMS *params)Initializes the default parameters for recognition of totally unimodular matrices.Definition: tu.c:15+CMR_EXPORT CMR_ERROR CMRtuCompleteDecomposition(CMR *cmr, CMR_SEYMOUR_NODE *dec, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit)Completes a subtree of an existing decomposition tree.Definition: tu.c:693CMR_EXPORT CMR_ERROR CMRtuCompleteDecomposition(CMR *cmr, CMR_SEYMOUR_NODE *dec, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit)Completes a subtree of an existing decomposition tree.Definition: tu.c:707@ CMR_TU_ALGORITHM_PARTITIONEnumeration algorithm based on criterion of Ghouila-Houri.Definition: tu.h:25@ CMR_TU_ALGORITHM_EULERIANEnumeration algorithm based on Eulerian submatrices.Definition: tu.h:24-@ CMR_TU_ALGORITHM_DECOMPOSITIONAlgorithm based on Seymour's decomposition of regular matroids.Definition: tu.h:23-CMR_EXPORT CMR_ERROR CMRtuStatsInit(CMR_TU_STATS *stats)Initializes all statistics for recognition algorithm for totally unimodular matrices.Definition: tu.c:26-CMR_EXPORT CMR_ERROR CMRtuStatsPrint(FILE *stream, CMR_TU_STATS *stats, const char *prefix)Prints statistics for recognition algorithm for totally unimodular matrices.Definition: tu.c:43+CMR_EXPORT CMR_ERROR CMRtuTest(CMR *cmr, CMR_CHRMAT *matrix, bool *pisTotallyUnimodular, CMR_SEYMOUR_NODE **pdec, CMR_SUBMAT **psubmatrix, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit)Tests a matrix for being totally unimodular.Definition: tu.c:617+CMR_EXPORT CMR_ERROR CMRtuStatsInit(CMR_TU_STATS *stats)Initializes all statistics for recognition algorithm for totally unimodular matrices.Definition: tu.c:27+CMR_EXPORT CMR_ERROR CMRtuTest(CMR *cmr, CMR_CHRMAT *matrix, bool *pisTotallyUnimodular, CMR_SEYMOUR_NODE **proot, CMR_SUBMAT **psubmatrix, CMR_TU_PARAMS *params, CMR_TU_STATS *stats, double timeLimit)Tests a matrix for being totally unimodular.Definition: tu.c:620CMR_EXPORT CMR_ERROR CMRtuStatsPrint(FILE *stream, CMR_TU_STATS *stats, const char *prefix)Prints statistics for recognition algorithm for totally unimodular matrices.Definition: tu.c:44
- s -
- s -
- n -
-
: _CMR_SEYMOUR_NODE