https://github.com/l3mon4d3/co

https://github.com/l3mon4d3/co

Last synced: about 1 month ago
JSON representation

• Host: GitHub
• URL: https://github.com/l3mon4d3/co
• Owner: L3MON4D3
• Created: 2022-11-17T09:08:28.000Z (about 2 years ago)
• Default Branch: master
• Last Pushed: 2022-11-23T12:24:41.000Z (about 2 years ago)
• Last Synced: 2024-10-12T22:51:58.125Z (2 months ago)
• Language: C++
• Size: 28.3 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Run `make` for building, `./CMA --graphs ` to run the algorithm,

output is the matching in dimacs-format.

Make sure gcc-12.2 (others might also work, just 11 does not work) is installed.

It's possible to generate graphviz-visualizations for every step of the

algorithm, enable in Makefile (`-DCAPTURE_STEPS`) (not recommended for graphs

bigger than about 100 nodes :D), they can be converted to svg via make-target

`capture_convert`.

overview:

* `path_iterators.hpp` defines iterators for walking the mu-phi-paths (or

  rho-mu-phi)

* `graph.hpp` is the graph-class from the website, we only use it for converting

  DIMACS to a graph-structure, our algorithm works on the graph-class in

  `ecma.hpp`

* `ecma.hpp` contains the node and graph specifically for the

  matching-algorithm