How armandofln/local-graham works
This is a small C command-line search program for a Ramsey/Graham-theory coloring problem. Its workflow accepts a dimension and search-method options, constructs a random two-coloring of graph edges, searches for a coloring with no monochromatic target subgraphs, and reports a counterexample or the best score. Geometry and scoring are distinct internal stages. The excerpts show some calls but omit parts of main and other function bodies, so the graph leaves those relationships out rather than inferring them.
Main entry points: graham.c Program entry · examples.txt Examples output
Components 11
Inputs and geometry
- Program entry
graham.c - Argument handling
graham.c - Coplanar subsets
graham.c - Subset edge mapping
graham.c
Coloring search
- Random edge coloring
graham.c - Monochromy scoring
graham.c - Steepest search
graham.c - First-choice search
graham.c
Results
- Result reporting
graham.c - Examples output
examples.txt
Other components
- CLI user
Connections 10
- CLI user → Program entry: runs
- Program entry → Argument handling: parses options
graham.c - Program entry → Random edge coloring: initializes coloring
graham.c - Program entry → Steepest search: calls search
graham.c - Coplanar subsets → Subset edge mapping: enumerates edges
graham.c - Steepest search → Monochromy scoring: scores candidates
graham.c - First-choice search → Monochromy scoring: scores candidates
graham.c - Steepest search → Result reporting: reports counterexample
graham.c - First-choice search → Result reporting: reports counterexample
graham.c - Result reporting → Examples output: writes result
graham.c