This project has 3 functions namely:
- _breadth_first_traversal.py: It performs breadth first search on the given graph. Requirements are source vertex(int) from which breadth first search is to be performed. It returns frontier_from_src, parent (tuple(List(int), List(int)) i.e. the level of each reachable vertex in the BFS tree and parent of each vertex found during the traversal.
- _depth_first_traversal.py: As the name suggests, it performs depth first search on the given graph. Requirements are source vertex(int) from which depth first search is to be performed. It returns predecessor (List[int]), topo_order (List[int]) i.e. list of dfs predecessors such that predecessor[i] = predecessor of i found during DFS traversal and topo sort of the graph obtained.
- _shortest_paths.py: It performs Bellman-Ford algorithm on the given graph taking source vertex as input requirement and returns dist (List(int)), pre (List(int)) i.e. shortest path lengths between source s to all other vertices of a weighted graph and predecessor in the path from s to each vertex respectively.
You can access Pygraph from here
pygraph/
|
├── .gitignore
├── LICENSE
├── README.md
├── pyproject.toml
├── setup.cfg
├── setup.py
├── src
| ├── Graph
| | ├── __init__.py
| | ├── _breadth_first_traversal.py
| | | ├── breadth_first_search
| | | ├── unweighted_shortest_paths
| | | ├── bfs_tree
| | | └── is_bipartite
| | ├── _depth_first_traversal.py
| | | ├── dfs_visit
| | | ├── depth_first_search
| | | ├── topological_sort
| | | └── is_cyclic
| | └── _shortest_paths.py
| | └── find_shortest_paths
└── tests
├── _bfs_test.py
├── _dfs_test.py
└── _shortest_paths_test.py
- Mahi Monga: Github Linkedin
- Vaibhavi Lokegaonkar: Github Linkedin
- Tanmayee Pemmaraju: Github Linkedin
All rights reserved. Licensed under the MIT License.
