Statement of Problem:

This program is able to find and display the strong components in DIMACS graph benchmark files. It uses functions from given header files d_graph.h, d_galgs.h, d_except.h, d_heap.h, d_util.h, d_pqueue.h, and d_stree, which are given by "Data Structures with C++ Using STL."