testBFS.c

#include "graphAPI/graph_jrb.h"
#include <stdio.h>
#include <stdlib.h>

void printVertex(int v) { printf ("%d ", v); }

int main () {
    char *mapping[10];
    Graph g = createGraph();
    addEdge (g, mapping, "0", "1", 0, UNDIRECTED);
    addEdge (g, mapping, "1", "2", 0, UNDIRECTED);
    addEdge (g, mapping, "1", "3", 0, UNDIRECTED);
    addEdge (g, mapping, "2", "3", 0, UNDIRECTED);
    addEdge (g, mapping, "2", "4", 0, UNDIRECTED);
    addEdge (g, mapping, "4", "5", 0, UNDIRECTED);
    bfs (g, 1, -1, printVertex);
    puts("");
    
    dfs_norecur (g, 1, -1, printVertex);
    puts("");
    int *path = (int *)malloc(getNumofV(g));
    int shortest_path = shortest_noWeight_path(g, 1, 4, path);
    printf ("%d\n", shortest_path);
    int i=0;
    for (i=0; i<shortest_path; ++i)
        printf ("%d ", path[i]);
    puts ("");
    
    return 0;
}