adgph2.out
来自「数据结构c++语言描述 Borland C++实现」· OUT 代码 · 共 38 行
OUT
38 行
Enter the number of vertices in the digraph
Enter the number of edges in the digraph
Enter edge 1
Enter edge 2
Enter edge 3
Enter edge 4
Enter edge 5
Enter edge 6
The digraph has 6 edges.
0 1 1 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 0
0 0 0 0 1 1 0 0
0 0 0 0 0 0 0 0
Enter the number of vertices in the digraph
Enter the number of edges in the digraph
Enter edge 1
Enter edge 2
Enter edge 3
Enter edge 4
Enter edge 5
Enter edge 6
Enter edge 7
Enter edge 8
Enter edge 9
Enter edge 10
The digraph has 10 edges.
0 0 0 0 0 1
1 0 0 0 0 1
0 1 0 0 1 1
1 1 0 0 1 0
0 1 0 0 0 0
0 0 0 0 0 0
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?