starmos
asked on
Use Bellman-Ford Algorithm to find least cost path
The Bellman-Ford algorithm is descibed as a method for finding the least-cost path through a partially-connected network. Using the C programming language, write a UNIX program which implements the Bellman-Ford algorithm to compute (i) the least-cost and (ii) the least cost path between any two nodes in a switched network. Input data for your program will be stored in a text file which describes the link and link costs for all your nodes in the network (upto a maximum of 12 nodes). The input has the following format:-
Alternatively, the user may be prompted to input data into the program.
The output of the program should display a table similar to:
h D2 Path D3 Path D4 Path D5 Path D6 Path
Alternatively, the user may be prompted to input data into the program.
The output of the program should display a table similar to:
h D2 Path D3 Path D4 Path D5 Path D6 Path
ASKER
Please note that while I realise there are other questions to be answered, I would really appreciate an answer by Saturday 7 June. Thanks in advance!
Well, this is a homework, and that's a first problem.
Second problem is that you didn't request any advice, you just asked for the code, which is not exactly what this forum is intended for: IMHO, one should buy for a ready code.
I don't mean to be rude, just trying to give you some reasons.
As a personal suggestion, try to write the code yourself, then feel free to ask here for any problem you may face.
Rgds, julio
Second problem is that you didn't request any advice, you just asked for the code, which is not exactly what this forum is intended for: IMHO, one should buy for a ready code.
I don't mean to be rude, just trying to give you some reasons.
As a personal suggestion, try to write the code yourself, then feel free to ask here for any problem you may face.
Rgds, julio
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER