Graph Theory/Weighted graphs and algorithms

Algorithm (Dijkstra's algorithm):

Let $G=(E,V)$ be a finite digraph with weight $c:E\to \mathbb {R}$. Fix a node $x\in V$. Then the following algorithm computes a shortest path from any node other than $x$ to $x$:

In C, the graph $G$ and the function $c:E\to \mathbb {R}$ shall be given by the nodes $0,\ldots ,n-1$ (where $n=|V|$ and $x=0$) and a weight function double long weight(int source, int target) which is $-1$ whenever source and target are not incident.

boolean nextStep[n];
int nextStepLength;

nextStepLength = 1;
for(k=0;k<n;k++) {
    nextStep[k] = k;
}

int step;
int vNo;
for(step=0;step<n;step++) {
    for(vNo = 0; vNo < nextStepLength; vNo++) {
        
    }
}