Apply Dijkstras and Bellman Fords algorithm to the given network as shown in fig and find at least the cost path between source node 1 to all other nodes.

4.1kviews

written 6.9 years ago by

teamques10 ★ 70k

• modified 5.6 years ago

enter image description here

computer communication network

ADD COMMENT EDIT

1 Answer

69views

written 6.8 years ago by

teamques10 ★ 70k

• modified 6.8 years ago

PART 1: USING DIJKSTRA'S ALGORITHM:

Let node 1 --> A, 2 --> B, 3 --> C, 4 --> D, 5 --> E, 6 --> F.

Step 1: Starting node is A. Enter it into group P as shown in the table a. Add neighbours B, C, F to temporary group …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.