代码搜索：OUT
找到约 10,000 项符合「OUT」的源代码
代码结果 10,000
www.eeworm.com/read/201477/15407330
out firstfit.out
Enter number of objects and bin capacity
Enter space requirement of object 1
Enter space requirement of object 2
Enter space requirement of object 3
Enter space requirement of object 4
Enter spac
www.eeworm.com/read/201477/15407343
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/201477/15407344
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/201477/15407350
out dbst.out
Elements in ascending order are
1 a 6 b 6 c 8 d 8 e
Delete of 4 fails
Elements in ascending order are
1 a 6 b 6 c 8 d 8 e
Delete of 8 succeeds
8 d
Elements in ascending order are
www.eeworm.com/read/201477/15407355
out kruskal.out
enter number of edges of 7 vertex graph
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
The input graph is
Vertex 1 = 6
www.eeworm.com/read/201477/15407366
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/201477/15407370
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