[SOLVED] algorithm graph Project requirements

Project requirements
The goal of this project is to implement distance vector routing algorithms. To make this simpler, it is broken up into several parts. This algorithm works on weighted graphs, so as input to your project, you will be given a file describing the graph with the following json format:

1. 10 points Read in the graph configuration file.
2. 50 points Implement the BellmanFord distance vector algorithm. Because this algorithm is distributed, you need to do the following:
a For each node in the graph, you need to spawn a separate process. programmatically
b Each process needs to use UDP to exchange information with the neighbors specified in the graph file.
c Each process should start with only local information, meaning the costs to send to each neighbor node. Its OK to read in the whole file, but you cant use information from the file that isnt for your node.
d You should create a protocol to exchange distance vector information, as required by BellmanFord.
e Nodes should asynchronously exchange distance vector information as needed until the algorithm converges.
f Since costs are fixed, you dont have to worry about poison reverse or anything other than the basic algorithm.
g After convergence, each node should output their local DV table to a file once file per node.Again, this can have any format, but you should document this in your report.

json
110
250BellmanFord
a
bUDP
conly
dBellmanFord
e
fgDV

BellmanFord

DV

poison reverse