Dataset

Synthetic Zigzag

A small synthetic graph designed to create a path-like hard connectivity pattern.

Bipartite incidence pattern for Synthetic Zigzag

Graph Summary

Small but intentionally pathological for convergence.

The primary benchmark graph is built from unique (id1, id2) pairs. The figure shows a binned sparsity pattern of the bipartite incidence block, with both partitions relabeled to contiguous integer identifiers. This block is the off-diagonal part of the corresponding graph Laplacian.

10,002rows
10,000unique edges
5,000id1 levels
5,001id2 levels
1components
10,001nodes

Variables

Columns in the clean CSV:

id1 id2 x1 x2 y

The v1 graph uses id1 and id2. No additional identifier-like columns are included in this clean v1 CSV.

Source Notes

Generated by the synthetic zigzag benchmark script included with this collection.

Synthetic path-like matching benchmark designed to be small but difficult.

Creation Files

The synthetic data-generating files are included for researchers who want to inspect or adapt the construction.