graph-methods-algorithms

This is an implementation of Undirected and Directed Graph ADTs. The implementation includes below methods for each graph type:

Undirected Graph (via Adjacency List)

• add_vertex()
• add_edge()
• remove_edge()
• remove_vertex()
• get_vertices()
• get_edges()
• is_valid_path()
• dfs()
• bfs()
• count_connected_components()
• has_cycle()

Directed Graph (via Adjacency Matrix)

• add_vertex()
• add_edge()
• remove_edge()
• get_vertices()
• get_edges()
• is_valid_path()
• dfs()
• bfs()
• has_cycle()
• dijkstra()