This repository contains the implementation of a Disjoint Paths Algorithm that works specifically with symmetric networks. The algorithm is separated into two Jupyter Notebook files, Networks.ipynb and DisjointPathsAlgorithm.ipynb.
The following packages need to be installed to use the algorithm:
pip install network
pip install import-ipynb- Assign the network you want to test to the testNetwork variable.
- Pass the source node and destination node to the beginDiscovery function.
If you are looking to create a new network, simply create an object with the following attributes:
- A list of nodes.
- A list of edges, represented as a list of tuples containing the edges between all nodes.
If you find this algorithm useful in your research, please consider citing our paper. The citation format will be available soon.
Feel free to submit pull requests, create issues or share this repository. All contributions are welcomed!
For any other queries, reach out to us at [email protected]
We appreciate all the contributions made to this project and would like to thank all the collaborators for their tireless efforts.