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.

Renders a PLY 3D Model from file using OpenGL with GLFW.

Playing with a 3D scan of a "car wreck".

Homework solutions for Graph Theory ("Teorija grafova") course at FER 2020/21 led by prof. dr. sc. Mario Osvin Pavčević

Trabalho Prático de Algoritmos 2

PLY Vertex Colors OpenGL

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.