python prim algorithm code example

Example 1: c program for prims algorithm

#include<stdio.h>
#include<conio.h>
int a,b,u,v,n,i,j,ne=1;
int visited[10]= {	0},min,mincost=0,cost[10][10];
void main() {	
clrscr();	
printf("\n Enter the number of nodes:");	
scanf("%d",&n);	
printf("\n Enter the adjacency matrix:\n");	
for (i=1;i<=n;i++)	  
    for (j=1;j<=n;j++) {		
      scanf("%d",&cost[i][j]);		
      if(cost[i][j]==0)		    
      cost[i][j]=999;	
      }	
    visited[1]=1;	
    printf("\n");	
    while(ne<n) {		
      for (i=1,min=999;i<=n;i++)		  
        for (j=1;j<=n;j++)		    
          if(cost[i][j]<min)		     
          if(visited[i]!=0) {			
          min=cost[i][j];			
          a=u=i;			
          b=v=j;		
          }		
          if(visited[u]==0 || visited[v]==0) 
          {			
            printf("\n Edge %d:(%d %d) cost:%d",ne++,a,b,min);
            mincost+=min;			
            visited[b]=1;		
            }		
          cost[a][b]=cost[b][a]=999;	
          }	
          printf("\n Minimun cost=%d",mincost);
          getch();
}

Example 2: prim's algorithm python

def empty_graph(n):
    res = []
    for i in range(n):
        res.append([0]*n)
    return res
def convert(graph):
    matrix = []
    for i in range(len(graph)): 
        matrix.append([0]*len(graph))
        for j in graph[i]:
            matrix[i][j] = 1
    return matrix
def prims_algo(graph):
    graph1 = convert(graph)
    n = len(graph1)
    tree = empty_graph(n)
    con =[0]
    while len(con) < n :
        found = False
        for i in con:
            for j in range(n):
                if j not in con and graph1[i][j] == 1:
                    tree[i][j] =1
                    tree[j][i] =1
                    con += [j]
                    found  = True
                    break
            if found :
                break
    return tree
matrix = [[0, 1, 1, 1, 0, 1, 1, 0, 0],
          [1, 0, 0, 1, 0, 0, 1, 1, 0],
          [1, 0, 0, 1, 0, 0, 0, 0, 0],
          [1, 1, 1, 0, 1, 0, 0, 0, 0],
          [0, 0, 0, 1, 0, 1, 0, 0, 1],
          [1, 0, 0, 0, 1, 0, 0, 0, 1],
          [1, 1, 0, 0, 0, 0, 0, 0, 0],
          [0, 1, 0, 0, 0, 0, 0, 0, 0],
          [0, 0, 0, 0, 1, 1, 0, 0, 0]]

lst = [[1,2,3,5,6],[0,3,6,7],[0,3],[0,1,2,4],[3,5,8],[0,4,8],[0,1],[1],[4,5]]
print("From graph to spanning tree:\n")
print(prims_algo(lst))