GPU Parallel Graph Coloring, Shortness Centrality, BFS & Nearest Neighbor Search - CS 406 Homework
-
Updated
Apr 5, 2018 - C
GPU Parallel Graph Coloring, Shortness Centrality, BFS & Nearest Neighbor Search - CS 406 Homework
Design and Analysis of Algorithms
This GitHub project is a C implementation of the Greedy Graph Coloring Algorithm. The algorithm aims to color the vertices of an undirected graph in such a way that no two adjacent vertices share the same color, while minimizing the total number of colors used.
Solução de puzzle Sudoku 9x9 com cores 1,2,..,9 utilizando algoritmo para coloração minima de grafos com backtracking e indice cromático 9
🌈 Trabalho Prático 3 - AEDs III
Add a description, image, and links to the coloring-graph topic page so that developers can more easily learn about it.
To associate your repository with the coloring-graph topic, visit your repo's landing page and select "manage topics."