LN Ant Routing algorithm simulation using NetworkX and Python.
The logic is based on https://github.com/LNantfarm/ant-routing-simul
Import Network class from antrouting.py
from antrouting import Network
To create your network, defines all connections between nodes. Alice is node 0 and Bob is the max index node
connections = [
(0,1),
(1,2),
(2,3),
(3,4),
(1,3),
(4,5)
]
#Here, Alice is node 0, Bob is node 5
Create a network object from the Network class
network = Network(connections)
Display the network
network.display()
Calculate the shortest path
network.find_shortest_path()
Check example.py to get an example on how to use the simulation.
The network creation is not really user friendly, an improvement could be done here. For example, an easy way of creating the network would be to draw the network in Polar, and automatically translate it to a list of connections.