University project in the field of Graph Theory
One program handles the node three-coloring of a given graph, while the other tells the longest found cycle. Both problems are NP complete therefore the bruteforce approach is necesary.
-
Notifications
You must be signed in to change notification settings - Fork 0
Solves three-coloring problem and finds longest cycle in a given graph
License
coldwarrior5/Graph-analyser
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Solves three-coloring problem and finds longest cycle in a given graph
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published