Description: Using the neighbor table to store the structure, the preparation of a judge not to any given graph between two vertices if there exists a simple path of length k of the algorithm.
To Search:
File list (Check if you may need any files):
tu.cpp