I need a program which works as below:
It takes in input:
• a node v
• One of the following distances function: t(x,y), d(x,y) or network distance (i.e. consider all edges to have weight equal to 1).
• a distance threshold d
Implement an algorithm (using proper data structures) that returns the set of nodes at distance <= d from v, corresponding to v’s neighborhood
Download the data with which you have to work from here [login to view URL] Download the data in the name CAL
Project fee is fixed 600 INR