#include "bfs.h"
#include <stdlib.h>
Include dependency graph for bfs.c:
Go to the source code of this file.
Functions | |
void | bfs (int vertex, vtx_data *graph, int n, DistType *dist, Queue *Q) |
int | bfs_bounded (int vertex, vtx_data *graph, int n, DistType *dist, Queue *Q, int bound, int *visited_nodes) |
void | mkQueue (Queue *qp, int size) |
Queue * | newQueue (int size) |
void | freeQueue (Queue *qp) |
void | delQueue (Queue *qp) |
void | initQueue (Queue *qp, int startVertex) |
boolean | deQueue (Queue *qp, int *vertex) |
boolean | enQueue (Queue *qp, int vertex) |
Definition at line 30 of file bfs.c.
References deQueue(), enQueue(), graph(), initQueue(), INT_MAX, and NULL.
Referenced by compute_apsp_packed(), and embed_graph().
int bfs_bounded | ( | int | vertex, | |
vtx_data * | graph, | |||
int | n, | |||
DistType * | dist, | |||
Queue * | Q, | |||
int | bound, | |||
int * | visited_nodes | |||
) |
Definition at line 77 of file bfs.c.
References deQueue(), enQueue(), graph(), and initQueue().
Referenced by dijkstra_bounded().
void delQueue | ( | Queue * | qp | ) |
Definition at line 157 of file bfs.c.
References Queue::data, Queue::end, FALSE, Queue::start, and TRUE.
Referenced by bfs(), and bfs_bounded().
Definition at line 165 of file bfs.c.
References Queue::data, Queue::end, FALSE, Queue::queueSize, and TRUE.
Referenced by bfs(), and bfs_bounded().
void freeQueue | ( | Queue * | qp | ) |
Definition at line 139 of file bfs.c.
References Queue::data, and free().
Referenced by compute_apsp_packed(), and dijkstra_bounded().
void initQueue | ( | Queue * | qp, | |
int | startVertex | |||
) |
Definition at line 150 of file bfs.c.
References Queue::data, Queue::end, and Queue::start.
Referenced by bfs(), and bfs_bounded().
void mkQueue | ( | Queue * | qp, | |
int | size | |||
) |
Definition at line 125 of file bfs.c.
References Queue::data, Queue::end, N_GNEW, Queue::queueSize, and Queue::start.
Referenced by compute_apsp_packed(), dijkstra_bounded(), embed_graph(), and newQueue().