卷別
資料結構
選擇國立中央大學 2026 · 考試 · 第 32 題
The adjacency-matrix representation of a graph assumes that the vertices are numbered . Then the adjacency-matrix representation of a graph consists of a matrix such that
Let V = {1,2,3,4,5} and its adjacency matrix be
| 1 | 2 | 3 | 4 | 5 | |
|---|---|---|---|---|---|
| 1 | 0 | 1 | 0 | 1 | 0 |
| 2 | 0 | 0 | 0 | 0 | 1 |
| 3 | 0 | 0 | 0 | 0 | 1 |
| 4 | 0 | 1 | 0 | 0 | 0 |
| 5 | 0 | 0 | 0 | 1 | 0 |
Which of the following descriptions is WRONG or the least accurate?
- (A)
E={(1,2),(1,4),(2,5),(3,5),(4,2),(5,4)} - (B)The graph is a directed acyclic graph
- (C)The graph has 5 vertices
- (D)The graph has 6 edges
- (E)There is no path that can go from vertex 1 to vertex 3