gistfile1.txt

struct fuel traverse(uint64_t graph[][VERTEX_MAX], int via[][VERTEX_MAX], struct pair p, struct fuel val) {
    int v = via[p.start][p.end];
    if(v == VIA_NONE) {
        // do something
    }
    struct fuel val2 = traverse(graph, via, (struct pair){p.start, v}, val);
    return traverse(graph, via, (struct pair){v, p.end}, val2);
}


// Warshall-floyd
for(k = 0; k < vs; k++) {
    for(i = 0; i < vs; i++) {
        for(j = 0; j < vs; j++) {
            if(graph[i][j] > graph[i][k] + graph[k][j]) {
                graph[i][j] = graph[i][k] + graph[k][j];
                via[i][j] = k;
            }
        }
    }
}