Affnine deltaleaf

Easy way to create MAP (Undirected Graph)and find shortest path from one Node to another.

Installation

Use the package manager pip to install foobar.

pip install affnine-deltaleaf

Quick start

import affnine_deltaleaf

newMap=afn_spf.deltaLeaf()         #create a object of affnine deltaleaf

newMap.editNameOfTheMap("Miramar") #assign a name to the map

newMap.updateDistance("A","B",1.1) # Distance from one node to another
newMap.updateDistance("A","D",2)
newMap.updateDistance("A","E",4)
newMap.updateDistance("B","E",2)
newMap.updateDistance("C","E",1)
newMap.updateDistance("C","D",5)
newMap.updateDistance("D","F",3)
newMap.updateDistance("E","F",3.4)
newMap.updateDistance("F","A",3)
newMap.updateDistance("G","B",3)
newMap.updateDistance("H","A",3)
newMap.updateDistance("I","C",3)
newMap.updateDistance("J","B",3)
newMap.updateDistance("K","E",3)

print(newMap.finder('A','E')) .   # Find shortest distance and 
                                  # path between two nodes

Output:

Contributing

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

Please make sure to update tests as appropriate.

License

MIT