make a Routers’ Graph to apply some useful algorithms on it. This Graph must be stored in orthogonal List. Finding Minimum Distances

See more:

MFC

make a Routers’ Graph to apply some useful algorithms on it. This Graph
must be stored in orthogonal List.
Finding Minimum Distances
In Network Communication System, the shortest path between the transmitter and receiver is
of most importance. Dijkestra Algorithm can suggest the shortest path between any two nodes
which are linked together by at least one path. implement Dijkestra’s Algorithm to
find the shortest path between one transmitter and all other existing nodes in the Routers’ graph.
The source node will be selected by the user and then your program must apply the Dijkestra
algorithm to find the minimum distances from that source to all other possible destinations in the
graph.
Finding Minimum Spanning Tree
In this Network Communication System, the Minimum Spanning Tree (MST) of the Routers’
apply the Kruskal’s Algorithm to find the MST of
the routers’ graph.