#include<stdio.h> #define V 5 int findmin(int graph[V][V], int visited[V], int ptr){ int min = 10000; int pos = ptr; for(int i=0; i<V; i++){ if(graph[ptr][i] < min && graph[ptr][i] > 0 && visited[i] == 0){ min = graph[ptr][i]; pos = i; } } return pos; } void trace(int graph[V][V], int visited[V], int ptr, int dest){ int pos = findmin(graph, visited, ptr); visited[pos] = 1; ptr = pos; if(ptr == dest){ return; } trace(graph, visited, ptr, dest); } void display(int graph[V][V], int visited[V]){ for(int i=0; i<V; i++){ for(int j=0; j<V; j++){ } } for(int i=0; i<V; i++){ } } int main(){ int graph[V][V] = {{0, 4, -1, -1, 8}, {0, 0, 8, -1, 11}, {0, 0, 0, 2, -1},{0,0,0,0,7}, {0,0,0,0,0}}; int visited[V] = {0, 0, 0, 0, 0}; int st = 0; int dest = 3; display(graph, visited); trace(graph, visited, st, dest); return 0; }
Title | Name | Language | UNIX | When |
---|---|---|---|---|
Re: Greedy Approach | Whipped Dove | c | 1654927298 | 1 Year ago. |
Edited Code | Amarnath | c | 1654927228 | 1 Year ago. |