Graph Theory algorithms: Vertex Coloring, Bellman-Ford, Dijkstra's, Hopcroft-Karp, Prim's, Topological Sorting, Floyd-Warshall
Efficient and High-quality Graph Coloring on the GPU
A web app used to visualize graph & network analysis algorithms.
Playing with a 3D scan of a "car wreck".
Renders a PLY 3D Model from file using OpenGL with GLFW.
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.
Graph-Theoretic Academic Management Engine. Implements advanced discrete mathematics (DSATUR vertex coloring, Bron-Kerbosch maximal cliques, and DAG topological sorting) in a native C++ core to resolve university scheduling and prerequisite conflicts, paired with a React/TypeScript interface.
PLY Vertex Colors OpenGL
A C++ console application for analyzing graph parameters, including degree sequences, bipartiteness, and vertex coloring (Greedy, LF, SLF).
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.
Homework solutions for Graph Theory ("Teorija grafova") course at FER 2020/21 led by prof. dr. sc. Mario Osvin Pavčević
To associate your repository with the vertex-coloring topic, visit your repo's landing page and select "manage topics."