Description: Enter as a directed graph. The number of edges is n, the starting point of each edge, end required input. The judge has the topology of the existence of the figure, if there is output, if there is a directed graph in the output of the loop.
To Search:
File list (Check if you may need any files):
TOPOLOGY.cpp
Download