func.h

Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and

/*----------------------------------------------------------------------
 * func.h
 * l-grafi version 0.1
 * Include con tutte le funzioni usate
 *----------------------------------------------------------------------*/

/* Funzioni per le matrici */

ADJMAT          *am_create (int size);
void            am_show (ADJMAT *am);
void            am_delete (ADJMAT *am);
int             am_adapt (ADJMAT *am, int size);
void            am_show (ADJMAT *am);
int             am_addvert (ADJMAT *am, int cnt);
int             am_addedge (ADJMAT *am, int src, int dst);

/* Funzioni per le liste di adiacenza */

dgraph_t        *dgraph_blank(int n);
dgraph_t	*dgraph_rnd_dense(int n, double prob);
void            add_new_edge(dgraph_vertex_t *vertex, int dest_vertex_no, long dist);
void            dgraph_free(dgraph_t *g);
dgraph_t        *add_al_from_vertex_to_vertex(dgraph_t *g,int s, int d);
void		al_show(dgraph_t *re);
dgraph_t 	*dgraph_rand(int nodi,float perc_archi);
/* Funzioni di test */

int             connect(dgraph_t *g,int s,int d);
int             al_edge_present_test(dgraph_edge_t *edge_ptr,int vertex_no);

/* Funzioni per le visite */

dfs_bfs_result_t 	*dfs(dgraph_t *g, int v);
dfs_bfs_result_t 	*bfs(dgraph_t *g, int v);
void 			dfs_bfs_result_free(dfs_bfs_result_t *r);
void 			dfs_bfs_result_print(dfs_bfs_result_t *r);

/* Funzioni per le cfc */

double          cfc(dgraph_t *g);
dgraph_t        *cfc_finish(sc_result_t *r,dgraph_t *cfc,int size);
dgraph_t        *cfc_graph(int s,dgraph_t *g,sc_result_t *r);
sc_result_t     *sc(dgraph_t *g, int v);
void            sc_result_free(sc_result_t *r);
void            sc_result_print(sc_result_t *r);

/* Conversione */

dgraph_t        * al_to_am(ADJMAT *am);
ADJMAT          * am_to_al(dgraph_t *g);


/* Algoritmi */

double          FloydWarshall(dgraph_t *g );
dgraph_t        *FloydWarshall_al(dgraph_t *g);

/* Misc */

ADJMAT          *LoadGraph_am(char* filename,int nodi,int rami);
double          random_lup(void);
void            rand_seed (unsigned int init);