Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
9 views4 pages

Assignment 2

The document outlines an assignment focused on connecting with a famous AI researcher, Dr. Meera, through mutual connections on LinkedIn. It discusses strategies for obtaining introductions based on the strength and reputation of connections, and includes a C program implementing Dijkstra's algorithm to find the best path based on connection weights. The program prompts the user for the number of nodes and edges, and calculates the shortest distance from a source node to all other nodes in a graph representation of connections.

Uploaded by

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

Assignment 2

The document outlines an assignment focused on connecting with a famous AI researcher, Dr. Meera, through mutual connections on LinkedIn. It discusses strategies for obtaining introductions based on the strength and reputation of connections, and includes a C program implementing Dijkstra's algorithm to find the best path based on connection weights. The program prompts the user for the number of nodes and edges, and calculates the shortest distance from a source node to all other nodes in a graph representation of connections.

Uploaded by

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

ASSIGNMENT 2

1. Imagine you want to connect with a famous AI researcher, Dr. Meera, on LinkedIn.
You don’t know her personally, but you have mutual connections. You want to find the
best way to get an introduction.
However, not all connections are equal! Some people know each other well (strong
connection), while others are just casual acquaintances (weak connection). If you go
through the strongest connections, you have a higher chance of getting a meaningful
introduction. How would you increase your chances to get best introduction.

2. Now, imagine that not all your connections help you equally. Some people have a
positive reputation (boosting your chances of a good introduction), while others have a
negative reputation (hurting your credibility).
Your goal is still to reach Dr. Meera, but this time, you want to take a path where the
overall influence score (sum of weights) is as high as possible (or least negative). How
would you increase your chances to get best introduction?

SOLUTION :-

#include <stdio.h>
#include <limits.h>

#define MAX_NODES 100


#define INF INT_MAX

int minDistance(int dist[], int visited[], int nodes) {


int min = INF, min_index = -1;
int v;
for (v = 0; v < nodes; v++) {
if (!visited[v] && dist[v] < min) {
min = dist[v];
min_index = v;
}
}
return min_index;
}

void dijkstra(int graph[MAX_NODES][MAX_NODES], int src, int nodes) {


int dist[MAX_NODES];
int visited[MAX_NODES] = {0};

int i;
for (i = 0; i < nodes; i++) {
dist[i] = INF;
}
dist[src] = 0;

int count;

for (count = 0; count < nodes - 1; count++) {


int u = minDistance(dist, visited, nodes);
if (u == -1) break;
visited[u] = 1;

int v;
for (v = 0; v < nodes; v++) {
if (!visited[v] && graph[u][v] && dist[u] != INF && dist[u] + graph[u][v]
< dist[v]) {
dist[v] = dist[u] + graph[u][v];
}
}
}

printf("Node \t Distance from Source %d\n", src);

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


printf("%d \t\t %d\n", i, dist[i]);
}
}

int main() {
int nodes, edges, u, v, weight, src;
int graph[MAX_NODES][MAX_NODES] = {0};

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


scanf("%d %d", &nodes, &edges);

printf("Enter the edges (node1 node2 weight):\n");


int i;
for (i = 0; i < edges; i++) {
scanf("%d %d %d", &u, &v, &weight);
graph[u][v] = weight;
graph[v][u] = weight;
}

printf("Enter the source node: ");


scanf("%d", &src);

dijkstra(graph, src, nodes);


return 0;
}

You might also like