Graphviz
2.41.20171026.1811
|
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 27 of file bfs.c.
References deQueue(), vtx_data::edges, enQueue(), initQueue(), INT_MAX, vtx_data::nedges, 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 74 of file bfs.c.
References deQueue(), vtx_data::edges, enQueue(), initQueue(), and vtx_data::nedges.
Referenced by dijkstra_bounded().
void delQueue | ( | Queue * | qp | ) |
Definition at line 141 of file bfs.c.
References Queue::data.
Definition at line 154 of file bfs.c.
References Queue::data, Queue::end, FALSE, Queue::start, and TRUE.
Referenced by bfs(), and bfs_bounded().
Definition at line 162 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 136 of file bfs.c.
References Queue::data.
Referenced by compute_apsp_packed(), and dijkstra_bounded().
Definition at line 147 of file bfs.c.
References Queue::data, Queue::end, and Queue::start.
Referenced by bfs(), and bfs_bounded().
Definition at line 122 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().