Código Haskell que reduz o problema de coloração em grafos para o problema de satisfabilidade booleana
-
Updated
Apr 17, 2019 - Haskell
#
color-graph
Here are 3 public repositories matching this topic...
Graph Theory in computer Application. Features of Graph Theory project are: Bipartile, Planner, Tree, paths of 1,2,3,... n length, cycles (loops) of 3,4,,,,n length, Euler paths or cycles, Hamilton paths and cycles, Color the graph, Check Izomorphism with other graph, Short Path between Two Nodes etc.
color tree planner graph path loops pathfinder graph-theory cycles length euler-path shortest-pathfinding-algorithm bipartite-graphs hamiltonian-cycles eulerproject shortest-path-algorithm shortestpath hamiltongraph color-graph izomorphism
-
Updated
Sep 20, 2018 - JavaScript
Implementations of useful algorithms
avl-tree cpp winforms python3 card-game a-star tkinter ids alpha-beta-pruning n-queens mini-max metaheuristics artificial-bee-colony external-sorting color-graph svoyi-koziri
-
Updated
Feb 10, 2023 - C++
Add this topic to your repo
To associate your repository with the color-graph topic, visit your repo's landing page and select "manage topics."