|
1 | 1 | module GraphProperties |
2 | 2 |
|
3 | | -# Write your package code here. |
| 3 | +export |
| 4 | + GraphProperty, |
| 5 | + PropertyComparison |
| 6 | + |
| 7 | +abstract type GraphProperty{T} end |
| 8 | + |
| 9 | +struct DegreeSequence <: GraphProperty{AbstractVector} end |
| 10 | + |
| 11 | +struct PropertyComparison{ |
| 12 | + Comparison <: Union{typeof(==), typeof(≤), typeof(≥)}, |
| 13 | + Property <: GraphProperty{<:Real}, |
| 14 | + Value, |
| 15 | +} <: GraphProperty{Bool} |
| 16 | + comparison::Comparison |
| 17 | + property::Property |
| 18 | + value::Value |
| 19 | +end |
| 20 | + |
| 21 | +struct FractionalChromaticNumber <: GraphProperty{Real} end |
| 22 | + |
| 23 | +struct FractionalMatchingNumber <: GraphProperty{Real} end |
| 24 | + |
| 25 | +struct NumberOfVertices <: GraphProperty{Integer} end |
| 26 | + |
| 27 | +struct NumberOfEdges <: GraphProperty{Integer} end |
| 28 | + |
| 29 | +struct NumberOfArcs <: GraphProperty{Integer} end |
| 30 | + |
| 31 | +struct NumberOfConnectedComponents <: GraphProperty{Integer} end |
| 32 | + |
| 33 | +struct MinimumDegree <: GraphProperty{Integer} end |
| 34 | + |
| 35 | +struct MaximumDegree <: GraphProperty{Integer} end |
| 36 | + |
| 37 | +struct Girth <: GraphProperty{Integer} end |
| 38 | + |
| 39 | +struct VertexConnectivity <: GraphProperty{Integer} end |
| 40 | + |
| 41 | +struct EdgeConnectivity <: GraphProperty{Integer} end |
| 42 | + |
| 43 | +struct CliqueNumber <: GraphProperty{Integer} end |
| 44 | + |
| 45 | +struct ChromaticNumber <: GraphProperty{Integer} end |
| 46 | + |
| 47 | +struct ChromaticIndex <: GraphProperty{Integer} end |
| 48 | + |
| 49 | +struct MatchingNumber <: GraphProperty{Integer} end |
| 50 | + |
| 51 | +struct DominationNumber <: GraphProperty{Integer} end |
| 52 | + |
| 53 | +struct IndependenceNumber <: GraphProperty{Integer} end |
| 54 | + |
| 55 | +struct Choosability <: GraphProperty{Integer} end |
| 56 | + |
| 57 | +struct FeedbackVertexSetNumber <: GraphProperty{Integer} end |
| 58 | + |
| 59 | +struct VertexCoverNumber <: GraphProperty{Integer} end |
| 60 | + |
| 61 | +struct EdgeCoverNumber <: GraphProperty{Integer} end |
| 62 | + |
| 63 | +struct IntersectionNumber <: GraphProperty{Integer} end |
| 64 | + |
| 65 | +struct BipartiteDimension <: GraphProperty{Integer} end |
| 66 | + |
| 67 | +struct HadwigerNumber <: GraphProperty{Integer} end |
| 68 | + |
| 69 | +struct TwinWidth <: GraphProperty{Integer} end |
| 70 | + |
| 71 | +struct CliqueWidth <: GraphProperty{Integer} end |
| 72 | + |
| 73 | +struct Treewidth <: GraphProperty{Integer} end |
| 74 | + |
| 75 | +struct Pathwidth <: GraphProperty{Integer} end |
| 76 | + |
| 77 | +struct Boxicity <: GraphProperty{Integer} end |
| 78 | + |
| 79 | +struct Degeneracy <: GraphProperty{Integer} end |
| 80 | + |
| 81 | +struct Arboricity <: GraphProperty{Integer} end |
| 82 | + |
| 83 | +struct Splittance <: GraphProperty{Integer} end |
| 84 | + |
| 85 | +struct IsUndirectedGraph <: GraphProperty{Bool} end |
| 86 | + |
| 87 | +struct IsDirectedGraph <: GraphProperty{Bool} end |
| 88 | + |
| 89 | +struct DigraphIsDAG <: GraphProperty{Bool} end |
| 90 | + |
| 91 | +struct DigraphIsOrientation <: GraphProperty{Bool} end |
| 92 | + |
| 93 | +struct GraphIsConnected <: GraphProperty{Bool} end |
| 94 | + |
| 95 | +struct DigraphIsWeaklyConnected <: GraphProperty{Bool} end |
| 96 | + |
| 97 | +struct DigraphIsStronglyConnected <: GraphProperty{Bool} end |
| 98 | + |
| 99 | +struct GraphIsBipartite <: GraphProperty{Bool} end |
| 100 | + |
| 101 | +struct GraphIsPath <: GraphProperty{Bool} end |
| 102 | + |
| 103 | +struct GraphIsCycle <: GraphProperty{Bool} end |
| 104 | + |
| 105 | +struct GraphIsPlanar <: GraphProperty{Bool} end |
| 106 | + |
| 107 | +struct DigraphIsPlanar <: GraphProperty{Bool} end |
| 108 | + |
| 109 | +struct GraphIsTriangleFree <: GraphProperty{Bool} end |
| 110 | + |
| 111 | +struct GraphIsComplete <: GraphProperty{Bool} end |
| 112 | + |
| 113 | +struct GraphIsRegular <: GraphProperty{Bool} end |
| 114 | + |
| 115 | +struct GraphIsPerfect <: GraphProperty{Bool} end |
| 116 | + |
| 117 | +struct GraphIsTriviallyPerfect <: GraphProperty{Bool} end |
| 118 | + |
| 119 | +struct GraphIsForest <: GraphProperty{Bool} end |
| 120 | + |
| 121 | +struct GraphIsTree <: GraphProperty{Bool} end |
| 122 | + |
| 123 | +struct GraphIsIndifferenceGraph <: GraphProperty{Bool} end |
| 124 | + |
| 125 | +struct GraphIsIntervalGraph <: GraphProperty{Bool} end |
| 126 | + |
| 127 | +struct GraphIsPtolemaic <: GraphProperty{Bool} end |
| 128 | + |
| 129 | +struct GraphIsChordal <: GraphProperty{Bool} end |
| 130 | + |
| 131 | +struct GraphIsMeynielGraph <: GraphProperty{Bool} end |
| 132 | + |
| 133 | +struct GraphIsCircleGraph <: GraphProperty{Bool} end |
| 134 | + |
| 135 | +struct GraphIsPermutationGraph <: GraphProperty{Bool} end |
| 136 | + |
| 137 | +struct GraphIsCograph <: GraphProperty{Bool} end |
| 138 | + |
| 139 | +struct GraphIsComparabilityGraph <: GraphProperty{Bool} end |
| 140 | + |
| 141 | +struct GraphIsDistanceHereditary <: GraphProperty{Bool} end |
| 142 | + |
| 143 | +struct GraphIsSplitGraph <: GraphProperty{Bool} end |
4 | 144 |
|
5 | 145 | end |
0 commit comments