mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 21:59:30 +00:00
ed4c92d98a
* Type annotations for `breadth_first_search.py` * Type annotations for `breadth_first_search_2.py` * Remove from excluded in mypy.ini * Add doctest.testmod() * Type annotations for `graphs/check_cycle.py` * Type annotations for `graphs/greedy_min_vertex_cover.py` * Remove from excluded in mypy.ini
93 lines
2.3 KiB
Python
93 lines
2.3 KiB
Python
#!/usr/bin/python
|
|
|
|
""" Author: OMKAR PATHAK """
|
|
from __future__ import annotations
|
|
|
|
from queue import Queue
|
|
|
|
|
|
class Graph:
|
|
def __init__(self) -> None:
|
|
self.vertices: dict[int, list[int]] = {}
|
|
|
|
def print_graph(self) -> None:
|
|
"""
|
|
prints adjacency list representation of graaph
|
|
>>> g = Graph()
|
|
>>> g.print_graph()
|
|
>>> g.add_edge(0, 1)
|
|
>>> g.print_graph()
|
|
0 : 1
|
|
"""
|
|
for i in self.vertices:
|
|
print(i, " : ", " -> ".join([str(j) for j in self.vertices[i]]))
|
|
|
|
def add_edge(self, from_vertex: int, to_vertex: int) -> None:
|
|
"""
|
|
adding the edge between two vertices
|
|
>>> g = Graph()
|
|
>>> g.print_graph()
|
|
>>> g.add_edge(0, 1)
|
|
>>> g.print_graph()
|
|
0 : 1
|
|
"""
|
|
if from_vertex in self.vertices:
|
|
self.vertices[from_vertex].append(to_vertex)
|
|
else:
|
|
self.vertices[from_vertex] = [to_vertex]
|
|
|
|
def bfs(self, start_vertex: int) -> set[int]:
|
|
"""
|
|
>>> g = Graph()
|
|
>>> g.add_edge(0, 1)
|
|
>>> g.add_edge(0, 1)
|
|
>>> g.add_edge(0, 2)
|
|
>>> g.add_edge(1, 2)
|
|
>>> g.add_edge(2, 0)
|
|
>>> g.add_edge(2, 3)
|
|
>>> g.add_edge(3, 3)
|
|
>>> sorted(g.bfs(2))
|
|
[0, 1, 2, 3]
|
|
"""
|
|
# initialize set for storing already visited vertices
|
|
visited = set()
|
|
|
|
# create a first in first out queue to store all the vertices for BFS
|
|
queue: Queue = Queue()
|
|
|
|
# mark the source node as visited and enqueue it
|
|
visited.add(start_vertex)
|
|
queue.put(start_vertex)
|
|
|
|
while not queue.empty():
|
|
vertex = queue.get()
|
|
|
|
# loop through all adjacent vertex and enqueue it if not yet visited
|
|
for adjacent_vertex in self.vertices[vertex]:
|
|
if adjacent_vertex not in visited:
|
|
queue.put(adjacent_vertex)
|
|
visited.add(adjacent_vertex)
|
|
return visited
|
|
|
|
|
|
if __name__ == "__main__":
|
|
from doctest import testmod
|
|
|
|
testmod(verbose=True)
|
|
|
|
g = Graph()
|
|
g.add_edge(0, 1)
|
|
g.add_edge(0, 2)
|
|
g.add_edge(1, 2)
|
|
g.add_edge(2, 0)
|
|
g.add_edge(2, 3)
|
|
g.add_edge(3, 3)
|
|
|
|
g.print_graph()
|
|
# 0 : 1 -> 2
|
|
# 1 : 2
|
|
# 2 : 0 -> 3
|
|
# 3 : 3
|
|
|
|
assert sorted(g.bfs(2)) == [0, 1, 2, 3]
|