https://github.com/federicobonel/map-coloring

RestAPI that provides backtracking and greedy algorithms to solve the map coloring problem (subset of the set of NP graph coloring problems) following the 4 color theorem (minimizes the number of colors used).
https://github.com/federicobonel/map-coloring

Last synced: about 18 hours ago
JSON representation

RestAPI that provides backtracking and greedy algorithms to solve the map coloring problem (subset of the set of NP graph coloring problems) following the 4 color theorem (minimizes the number of colors used).

• Host: GitHub
• URL: https://github.com/federicobonel/map-coloring
• Owner: FedericoBonel
• Created: 2022-02-17T09:01:19.000Z (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2022-11-02T03:09:49.000Z (about 2 years ago)
• Last Synced: 2024-03-04T06:38:54.388Z (11 months ago)
• Language: Java
• Homepage:
• Size: 83 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# mapGraph-coloring

RestAPI that exposes backtracking and greedy algorithms to solve the map coloring problem, a subset of

the set of NP graph coloring problems, following the [four color theorem](https://en.wikipedia.org/wiki/Four_color_theorem) (minimizes the number of colors used).

### Take a look at the Swagger Doc.

![map-coloring-swagger-ui](https://media.giphy.com/media/9Wv6EBfra5dG9vpKFq/giphy.gif)