DFS.cpp is a C++ program that
implements a depth first search of a randomly generated undirected graph.
DFS.cpp is based on the
ugraph class of the
LEDA library.
DFS.cpp includes commented references to the BFS
function.
Add the implementation of this function to DFS.cpp.
You will need to use a queue; use the
queue class from the LEDA library.
Remember, you have to work on
duck, and to compile programs using the LEDA library
you have to use this pattern:
g++ YourCode.cpp -I/mnt/disk1/LEDA-3.8a/incl -L/mnt/disk1/LEDA-3.8a -lG -lL