Implementation of undirected graph ADT with vertices and edges stored as an adjacency list.
Implementation of directed graph ADT with vertices and edges stored as adjacency matrix.
These programs were written as part of my first Data Structures course in university. Both DirectedGraph and UndirectedGraph classes include a range of methods that implement common functions and uses of these structures.
- add_vertex
- add_edge
- remove_edge
- get_vertices
- get_edges
- is_valid
- dfs
- bfs
- has_cycle
- dijkstra
- add_vertex
- add_edge
- remove_edge
- remove_vertex
- get_vertices
- get_edges
- is_valid_path
- dfs
- bfs
- count_connected_components
- has_cycle
Python 3
For suggestions or questions related to these programs, please contact: joel.swenddal@gmail.com