Description: If there is a DGA map vertex r, in r and the graph all the other vertices exist in between the departure from the r to the path are said to have roots in the DAG plans, test plans prepared by seeking the root of DAG algorithms.
File list (Check if you may need any files):
DAG图的根的算法
...............\A4-5.c
...............\A4-5.EXE
...............\A4-5报告.doc
Download