Dijkstra rough

module Dijkstra2 ();

reg [11:0] cost [0:49][0:49];

reg [0:5] key;

input clk;

parameter inf = 999;

     always @(posedge clk)
     begin
     function automatic [0:49] getMin;
     input [0:6] key;
     input [0:6] i;
     input [0:5] dist;
     input [0:1] visited;
        begin
            for(i=0; i<n; i=i+1)
                if(!visited[i] && dist [i] < min)
                min <= dist[i];
                key <= i;

           end
       end
     endfunction
     end
     end



always @(posedge clk)
   begin

     function dijkstra;
        input [0:49] par;
        input [0:49] dist;
        input [0:49] visited = 0;
        input [0:49] g;
        input [0:9] k=0;
        input [0:9] v=0;
        dist[src] = 0;
        par[src] = 1;
        begin
            for (k=0; k <=n-1; k=k+1)
                assign u = getMin(dist,visited);
                 for    (v 0; v < n; v v+1)
                    if(!visited[v] && (dist[u] + cost[u][v] < dist[v] && cost[u][v]! = 999 )
                    begin
                    par[v] = u;
                    dist[v] = dist[u] + cost[u][v];
                    end
                   end
                 end
                end
            end
        end
     endfunction
par[src] = -1;
      for(g=0; g<n-1; g=g+1)
            if(!visited[v] && (dist[u] + cost[u][v] < dist[v] && cost[u][v]! = 999 )
                begin
            par[v] = u;
            dist[v] = dist[u] + cost[u][v];
            end
                end

    end
end

endmodule