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 (  ) 

References dijkstra_d, and dijkstra_previous.

Referenced by audio_shutdown().

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 double_destroy ( double *  d  ) 

Referenced by dijkstra_init(), and dijkstra_run().

double* double_dup ( const double  d  ) 

void find_shortest_paths ( GHashTable *  adjacency,
GHashTable *  d,
GHashTable *  previous 
)

Referenced by dijkstra_run().

void initialize_dijkstra_d ( int  u,
GList *  vs,
GHashTable *  d 
)

References double_dup().

Referenced by dijkstra_run().


Variable Documentation


Generated on Wed Jun 3 23:12:29 2009 for Stage by  doxygen 1.5.9