sample.gph
来自「图论:最大支撑树算法实现 GraphM.h GraphOpr.h MaxS」· GPH 代码 · 共 12 行
GPH
12 行
# Graph example from book for connected components
6 # Number of vertices
U # Directed graph
# List of edges
0 2 7
0 4 9
1 2 5
1 5 6
2 3 1
2 5 2
3 5 2
4 5 1
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?