/SDiZO_2

A project made for Data Structures and Algorithm Complexity course. The program is about graphs. It can represent a graph as adjacency lists or as an incidency matrix, it can perform 2 MST algorithms (Prim, Kruskal), and 2 SPF algorithms (Dijkstra, Bellman-Ford). It also tests the time needed to perform an algorithm on each of the representations.

Primary LanguageC++

Watchers