Topology · star
Star Graph
All nodes point to a single hub node. TC is sparse.
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 · edges9 · 8
Closure |TC|8
Closure / edges1.0×
A small instance from the generator the benchmark runs with n from 100 upwards.
Definition
Symbol
S_n
Edges
\{(i, 1) \mid i \in 2..n\}
Generator
engine.data_generator.DataGenerator.generate_star_graphgenerate_db.py
def generate_star_graph(self, n: int) -> Generator[tuple[int, int], None, None]:
"""Generate a star graph with n nodes."""
logging.info(f'Generating star graph for n={n}')
for i in range(2, n + 1):
yield (i, 1)