These are my assignments for the Computational Modelling in Graphs course (SCC0216) at ICMC-USP.
- Erdős-Rényi model (Ex. 01)
- Breadth First Search (Ex. 02)
- Depth First Search (Ex. 03-a, Ex. 03-b)
- Dijkstra's algorithm (Ex. 04)
- Graph coloring (Project 01-a, Project 01-b)
- Prim's algorithm (Project 02)