Graph Theory - COS242
Assignment 1
- Breadth-first search (BFS);
- Depth-first search (DFS);
- Graph's diameter;
- Adjacency Matrix;
- Adjacency Vector.
Assignment 2
- Dijkstra's algorithm;
- Prim's algorithm;
- Mean distance of two vertices of the graph.
Assignment 3
- Coloring Algoritm (DSatu’s Approach) - The smallest hard-to-color graph for algorithm DSATUR