dijkstra.c File Reference
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include "dijkstra.h"
|
Functions |
void | dijkstra_destroy () |
void | dijkstra_free_d (int u, double *dist, gpointer junk) |
void | dijkstra_init () |
void | dijkstra_insert_edge (int u, int v, double w, gboolean temp_edge) |
void | dijkstra_remove_temp_edges () |
void | dijkstra_remove_temp_edges2 (gpointer key, GList *vs, gpointer adj) |
void | dijkstra_run () |
void | double_destroy (double *d) |
double * | double_dup (const double d) |
void | find_shortest_paths (GHashTable *adjacency, GHashTable *d, GHashTable *previous) |
void | initialize_dijkstra_d (int u, GList *vs, GHashTable *d) |
Variables |
GHashTable * | dijkstra_adjacency |
GHashTable * | dijkstra_d |
GHashTable * | dijkstra_previous |
Function Documentation
void dijkstra_destroy |
( |
|
) |
|
|
void dijkstra_free_d |
( |
int |
u, |
|
|
double * |
dist, |
|
|
gpointer |
junk |
|
) |
|
|
void dijkstra_insert_edge |
( |
int |
u, |
|
|
int |
v, |
|
|
double |
w, |
|
|
gboolean |
temp_edge |
|
) |
|
|
void dijkstra_remove_temp_edges |
( |
|
) |
|
|
void dijkstra_remove_temp_edges2 |
( |
gpointer |
key, |
|
|
GList * |
vs, |
|
|
gpointer |
adj |
|
) |
|
|
void double_destroy |
( |
double * |
d |
) |
|
|
double* double_dup |
( |
const double |
d |
) |
|
|
void find_shortest_paths |
( |
GHashTable * |
adjacency, |
|
|
GHashTable * |
d, |
|
|
GHashTable * |
previous |
|
) |
|
|
void initialize_dijkstra_d |
( |
int |
u, |
|
|
GList * |
vs, |
|
|
GHashTable * |
d |
|
) |
|
|
Variable Documentation
Generated on Thu Dec 13 13:55:21 2007 for Stage by
1.4.6