?? adjacencydigraph.output
字號:
Number of Vertices = 4
Number of Edges = 0
The graph is
Number of Vertices = 4
Number of Edges = 5
0 0 1 1
1 0 0 1
0 0 0 0
0 1 0 0
The graph after deleting (2,1) is
Number of Vertices = 4
Number of Edges = 4
0 0 1 1
0 0 0 1
0 0 0 0
0 1 0 0
existsEdge(3,1) = 0
existsEdge(1,3) = 1
inDegree(3) = 1
outDegree(1) = 2
Number of Vertices = 4
Number of Edges = 4
Vertices adjacenct to vertex 4
2
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -