1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
# ==================================================================================================================== #
# _____ _ _ ____ _ #
# _ __ _ |_ _|__ ___ | (_)_ __ __ _ / ___|_ __ __ _ _ __ | |__ #
# | '_ \| | | || |/ _ \ / _ \| | | '_ \ / _` || | _| '__/ _` | '_ \| '_ \ #
# | |_) | |_| || | (_) | (_) | | | | | | (_| || |_| | | | (_| | |_) | | | | #
# | .__/ \__, ||_|\___/ \___/|_|_|_| |_|\__, (_)____|_| \__,_| .__/|_| |_| #
# |_| |___/ |___/ |_| #
# ==================================================================================================================== #
# Authors: #
# Patrick Lehmann #
# #
# License: #
# ==================================================================================================================== #
# Copyright 2017-2025 Patrick Lehmann - Bötzingen, Germany #
# #
# Licensed under the Apache License, Version 2.0 (the "License"); #
# you may not use this file except in compliance with the License. #
# You may obtain a copy of the License at #
# #
# http://www.apache.org/licenses/LICENSE-2.0 #
# #
# Unless required by applicable law or agreed to in writing, software #
# distributed under the License is distributed on an "AS IS" BASIS, #
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. #
# See the License for the specific language governing permissions and #
# limitations under the License. #
# #
# SPDX-License-Identifier: Apache-2.0 #
# ==================================================================================================================== #
#
"""Performance tests for pyTooling.Graph."""
from pathlib import Path
from pyTooling.Graph import Graph as pt_Graph, Vertex as pt_Vertex, DestinationNotReachable
from . import PerformanceTest
if __name__ == "__main__": # pragma: no cover
print("ERROR: you called a testcase declaration file as an executable module.")
print("Use: 'python -m unittest <testcase module>'")
exit(1)
class EdgeLinking(PerformanceTest):
def test_LinkNewVertex_Flat(self) -> None:
def wrapper(count: int):
def func():
rootVertex = pt_Vertex(0)
for i in range(1, count):
rootVertex.EdgeToNewVertex(i)
return func
self.runSizedTests(wrapper, self.counts)
def test_LinkNewVertex_Linear(self) -> None:
def wrapper(count: int):
def func():
vertex = pt_Vertex(0)
for i in range(1, count):
vertex = vertex.EdgeToNewVertex(i).Destination
return func
self.runSizedTests(wrapper, self.counts)
class RandomGraph(PerformanceTest):
def ConstructGraphFromEdgeListFile(self, file: Path, vertexCount: int) -> pt_Graph:
graph = pt_Graph(name=str(vertexCount))
vList = [pt_Vertex(vertexID=v, graph=graph) for v in range(vertexCount)]
with file.open("r", encoding="utf-8") as f:
for line in f.readlines():
v, u, w = line.split(" ")
vList[int(v)].EdgeToVertex(vList[int(u)], edgeWeight=int(w))
# lenBFS = []
# # lenDFS = []
# for v in vList:
# bfsList = [u for u in v.IterateVerticesBFS()]
# # dfsList = [u for u in v.IterateVerticesDFS()]
# lenBFS.append(len(bfsList))
# # lenDFS.append(len(dfsList))
# # print(f"{v}: bfs={len(bfsList)}; dfs={len(dfsList)}")
# print(f"BFS: min={min(lenBFS)} avg={mean(lenBFS)} max={max(lenBFS)}({lenBFS.index(max(lenBFS))})")
# # print(f"DFS: min={min(lenDFS)} avg={mean(lenDFS)} max={max(lenDFS)}({lenDFS.index(max(lenDFS))})")
return graph
def test_BFS(self) -> None:
def wrapper(graph: pt_Graph, componentStartVertex: int, componentSize: int):
def func():
rootVertex = graph._verticesWithID[componentStartVertex]
bfsList = [v for v in rootVertex.IterateVerticesBFS()]
self.assertEqual(componentSize, len(bfsList))
return func
self.runFileBasedTests(self.ConstructGraphFromEdgeListFile, wrapper, self.edgeFiles)
def test_DFS(self) -> None:
def wrapper(graph: pt_Graph, componentStartVertex: int, componentSize: int):
def func():
rootVertex = graph._verticesWithID[componentStartVertex]
bfsList = [v for v in rootVertex.IterateVerticesDFS()]
self.assertEqual(componentSize, len(bfsList))
return func
self.runFileBasedTests(self.ConstructGraphFromEdgeListFile, wrapper, self.edgeFiles)
def test_ShortestPathByHops(self) -> None:
def wrapper(graph: pt_Graph, componentStartVertex: int, componentSize: int):
def func():
startVertex = graph._verticesWithID[49]
destinationVertex = graph._verticesWithID[20]
try:
vertexPath = [v for v in startVertex.ShortestPathToByHops(destinationVertex)]
except DestinationNotReachable:
pass
# print(f"path length: {len(vertexPath)}")
# self.assertEqual(6, len(vertexPath))
return func
self.runFileBasedTests(self.ConstructGraphFromEdgeListFile, wrapper, self.edgeFiles)
def test_ShortestPathByWeight(self) -> None:
def wrapper(graph: pt_Graph, componentStartVertex: int, componentSize: int):
def func():
startVertex = graph._verticesWithID[49]
destinationVertex = graph._verticesWithID[20]
try:
vertexPath = [v for v, w in startVertex.ShortestPathToByWeight(destinationVertex)]
except DestinationNotReachable:
pass
# print(f"path length: {len(vertexPath)}")
# self.assertEqual(6, len(vertexPath))
return func
self.runFileBasedTests(self.ConstructGraphFromEdgeListFile, wrapper, self.edgeFiles)
|
