代码搜索：OUT
找到约 10,000 项符合「OUT」的源代码
代码结果 10,000
www.eeworm.com/read/168218/9933381
out roots.out
There are two real roots 3 and 2
There is only one distinct root 4
The roots are complex
The real part is -1
The imaginary part is 2
Bad input. a is zero.
www.eeworm.com/read/168218/9933421
out dwbfs.out
enter number of edges in weighted digraph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
Doing bfs from vertex 1 labeling 1
Doing bfs from vertex 4 labeling 2
D
www.eeworm.com/read/168218/9933424
out lwdgraph.out
Edges = 0
The graph is
Vertex 1 = 4 4 3 2
Vertex 2 = 1 3 4 1
Vertex 3 =
Vertex 4 = 2 5
The graph after deleting is
Vertex 1 = 4 4 3 2
Vertex 2 = 4 1
Vertex 3 =
V
www.eeworm.com/read/168218/9933436
out adigraph.out
Edges = 0
The graph is
0 0 1 1
1 0 0 1
0 0 0 0
0 1 0 0
The graph after deleting is
0 0 0 1
1 0 0 1
0 0 0 0
0 1 0 0
Exist(3,1) = 0
InDegree(3) = 0
OutDegree(1) = 1
Edges = 4
www.eeworm.com/read/168218/9933439
out ldigraph.out
Edges = 0
The graph is
Vertex 1 = 4 3
Vertex 2 = 1 4
Vertex 3 =
Vertex 4 = 2
The graph after deleting is
Vertex 1 = 4 3
Vertex 2 = 1
Vertex 3 =
Vertex 4 = 2
Deletion
www.eeworm.com/read/168218/9933445
out adfs.out
enter number of edges
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
Doing DFS from vertex 1 labeling 1
Doing DFS from vertex 4 labeling 2
Vertex labels are
1
www.eeworm.com/read/168218/9933447
out lwgraph.out
Edges = 0
Vertex 1 = 4 4 2 4 3 2
Vertex 2 = 3 5 1 4 4 1
Vertex 3 = 2 5 1 2
Vertex 4 = 1 4 2 1
Edge (1,2) deleted
Vertex 1 = 4 4 3 2
Vertex 2 = 3 5 4 1
Vertex