import { GraphFixture } from './types';
/**
 * Star graph: 1 hub + 50 spokes.
 *
 * Worst case for node explosion - expanding the hub immediately exposes all nodes.
 * DP should defer hub expansion; BFS/FB expand hub immediately.
 */
export declare const starGraphFixture: GraphFixture;
/**
 * Hub-spoke graph: 4 interconnected hubs with 15 leaves each.
 *
 * Tests degree prioritisation on multi-hub topology.
 * DP should expand leaves before hubs; baselines converge through hubs.
 */
export declare const hubSpokeFixture: GraphFixture;
/**
 * Scale-free graph with preferential attachment.
 *
 * Simulates real-world citation networks with power-law degree distribution.
 * High-degree nodes emerge naturally; DP should avoid converging through them.
 */
export declare const scaleFreeFixture: GraphFixture;
/**
 * Grid graph (lattice) with uniform degree.
 *
 * Baseline for comparison - all algorithms should behave similarly
 * since there are no hubs to prioritize or avoid.
 */
export declare const gridFixture: GraphFixture;
/**
 * Double-star graph: two hubs connected, each with spokes.
 *
 * Tests pathfinding when optimal path MUST go through hubs.
 * Both algorithms will find the path, but DP explores more spokes first.
 */
export declare const doubleStarFixture: GraphFixture;
/**
 * All fixtures exported as a map.
 */
export declare const fixtures: Record<string, GraphFixture>;
/**
 * Get all fixtures as an array.
 */
export declare const allFixtures: () => GraphFixture[];
//# sourceMappingURL=fixtures.d.ts.map