Graph Theory algorithms: Vertex Coloring, Bellman-Ford, Dijkstra's, Hopcroft-Karp, Prim's, Topological Sorting, Floyd-Warshall
-
Updated
Aug 17, 2021 - Python
Graph Theory algorithms: Vertex Coloring, Bellman-Ford, Dijkstra's, Hopcroft-Karp, Prim's, Topological Sorting, Floyd-Warshall
This project explores the monochromatic triangle problem, leveraging genetic algorithms to find optimal solutions. It includes a visualization component to illustrate the problem and solution.
It is a optimisation technique project which is a timetable generator application which can be used to generate timetables for schools, colleges for each class for 5 days in a week by providing respective csv files.
MLP Dense network used to encode a representation of 3D object vertex colors for reconstruction.
Trains a neural network to output the RGB color for a given XYZ coordinate on a vertex colored 3D mesh.
Add a description, image, and links to the vertex-coloring topic page so that developers can more easily learn about it.
To associate your repository with the vertex-coloring topic, visit your repo's landing page and select "manage topics."