Topology · complete
Complete Graph
Every node has edges to every other node. Transitive closure is the graph itself.
Evaluation
Linear · T ∘ E–iterations (left / right recursion)
Doubling · T ∘ T–iterations (double recursion)
iteration 1new pairs per iteration
Point at a node (or tab to the drawing and use the arrow keys) to see every node it reaches, wave by wave. Those pairs are its rows of the closure.
Nodes · edges6 · 36
Closure |TC|36
Closure / edges1.0×
A small instance from the generator the benchmark runs with n from 100 upwards.
Definition
Symbol
K_n
Edges
\{(i,j) \mid i \in 1..n, j \in 1..n\}
Generator
engine.data_generator.DataGenerator.generate_complete_graphgenerate_db.py
def generate_complete_graph(self, n: int) -> Generator[tuple[int, int], None, None]:
"""Generate a complete graph with n nodes."""
# self.E = {(i, j) for i in range(1, n + 1) for j in range(1, n + 1)}
logging.info(f'Generating complete graph for n={n}')
for i in range(1, n + 1):
for j in range(1, n + 1):
yield (i, j)