摘要:
06-图1 列出连通集(25 分)给定一个有N个顶点和E条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时,假设我们总是从编号最小的顶点出发,按编号递增的顺序访问邻接点。输入格式:输入第1行给出2个整数N(0#include ... 阅读全文
摘要:
05-树8 File Transfer(25 分)We have a network of computers and a list of bi-directional connections. Each of these connections allows a f... 阅读全文