#include #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 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); printf("pos = %d", pos); 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