Scribd
Upload
50 views3 pages

Distance Vector Algorithm

The document contains C code to implement distance vector routing, an algorithm for calculating the shortest paths between nodes in a graph. It defines functions for finding the minimum of two numbers and performing distance vector routing. The distance vector routing function takes a distance matrix as input, initializes the matrix, performs updates using the algorithm, and outputs the original and updated shortest distance matrices. It then takes source and destination nodes as input and outputs the shortest distance between them.

Uploaded by

manojchougala14
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
50 views3 pages

Distance Vector Algorithm

The document contains C code to implement distance vector routing, an algorithm for calculating the shortest paths between nodes in a graph. It defines functions for finding the minimum of two numbers and performing distance vector routing. The distance vector routing function takes a distance matrix as input, initializes the matrix, performs updates using the algorithm, and outputs the original and updated shortest distance matrices. It then takes source and destination nodes as input and outputs the shortest distance between them.

Uploaded by

manojchougala14
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include <stdio.

h>

#include <limits.h>

#define MAX_NODES 10

// Function to find the minimum of two numbers

int min(int a, int b) {

return (a < b) ? a : b;

// Function to perform distance vector routing

void distanceVectorRouting(int graph[MAX_NODES][MAX_NODES], int nodes) {

int distance[MAX_NODES][MAX_NODES];

// Initializing distance matrix

for (int i = 0; i < nodes; i++) {

for (int j = 0; j < nodes; j++) {

distance[i][j] = graph[i][j];

// Output the original distance matrix

printf("Original distance matrix:\n");

for (int i = 0; i < nodes; i++) {

for (int j = 0; j < nodes; j++) {

printf("%d\t", graph[i][j]);

printf("\n");

// Updating distance matrix using distance vector routing algorithm


for (int k = 0; k < nodes; k++) {

for (int i = 0; i < nodes; i++) {

for (int j = 0; j < nodes; j++) {

if (distance[i][k] != INT_MAX && distance[k][j] != INT_MAX) {

distance[i][j] = min(distance[i][j], distance[i][k] + distance[k][j]);

// Output the shortest distance matrix

printf("\nShortest distance matrix:\n");

for (int i = 0; i < nodes; i++) {

for (int j = 0; j < nodes; j++) {

printf("%d\t", distance[i][j]);

printf("\n");

// Input two nodes to find the shortest path and distance

int source, destination;

printf("\nEnter source node: ");

scanf("%d", &source);

printf("Enter destination node: ");

scanf("%d", &destination);

// Output the shortest path and distance

printf("Shortest distance from node %d to node %d: %d\n", source, destination, distance[source]
[destination]);

int main() {
int nodes;

// Input the number of nodes

printf("Enter the number of nodes: ");

scanf("%d", &nodes);

int graph[MAX_NODES][MAX_NODES];

// Input distances between nodes

printf("Enter the distance matrix (use 'INT_MAX' for infinity):\n");

for (int i = 0; i < nodes; i++) {

for (int j = 0; j < nodes; j++) {

scanf("%d", &graph[i][j]);

// Perform distance vector routing and find shortest path and distance

distanceVectorRouting(graph, nodes);

return 0;

You might also like