BFSPWN 未解决
分数:
0
金币:
0
题目作者:
未知
一 血:
admin889
一血奖励:
0金币
解 决:
1
提 示:
Each test contains multiple test cases. The first line contains a single integer $T$ - the number of test cases. Description of the test cases follows. The first line of the input contains two unsigned integers $N$ and $K$ - the number of nodes and edges respectedly. Each of the next $K$ lines contains two unsigned integers $V$ and $U$ - the description of an edge. The last line contains two unsigned integers $P$ and $Q$ - the to and from nodes.
描 述:
You are given an unweighted graph with $N$ nodes and $K$ edges. Let $P$ and $Q$ be two nodes in the graph. You are asked to find the shortest path between the two nodes.
其 他:
下载
