|
Graphviz
2.29.20120523.0446
|
#include "defs.h"

Go to the source code of this file.
Data Structures | |
| struct | Queue |
Defines | |
| #define | _BFS_H_ |
Functions | |
| void | mkQueue (Queue *, int) |
| void | freeQueue (Queue *) |
| void | initQueue (Queue *, int startVertex) |
| boolean | deQueue (Queue *, int *) |
| boolean | enQueue (Queue *, int) |
| void | bfs (int, vtx_data *, int, DistType *, Queue *) |
| int | bfs_bounded (int, vtx_data *, int, DistType *, Queue *, int, int *) |
Definition at line 27 of file bfs.c.
References INT_MAX, initQueue(), NULL, deQueue(), vtx_data::nedges, vtx_data::edges, and enQueue().
Referenced by embed_graph(), and compute_apsp_packed().
Definition at line 74 of file bfs.c.
References initQueue(), deQueue(), vtx_data::nedges, vtx_data::edges, and enQueue().
Referenced by dijkstra_bounded().
Definition at line 154 of file bfs.c.
References Queue::start, Queue::end, FALSE, Queue::data, and TRUE.
Referenced by bfs(), and bfs_bounded().
Definition at line 162 of file bfs.c.
References Queue::end, Queue::queueSize, FALSE, Queue::data, and TRUE.
Referenced by bfs(), and bfs_bounded().
| void freeQueue | ( | Queue * | ) |
Definition at line 136 of file bfs.c.
References free(), and Queue::data.
Referenced by dijkstra_bounded(), and compute_apsp_packed().
| void initQueue | ( | Queue * | , |
| int | startVertex | ||
| ) |
Definition at line 147 of file bfs.c.
References Queue::data, Queue::start, and Queue::end.
Referenced by bfs(), and bfs_bounded().
| void mkQueue | ( | Queue * | , |
| int | |||
| ) |
Definition at line 122 of file bfs.c.
References Queue::data, N_GNEW, Queue::queueSize, Queue::start, and Queue::end.
Referenced by newQueue(), dijkstra_bounded(), embed_graph(), and compute_apsp_packed().
1.7.5