/**
 * Termination Property Tests for Seed-Bounded Graph Sampling
 *
 * Validates: On finite graph G=(V,E), expansion terminates in ≤ N×|V| steps
 * where N is the number of seed frontiers.
 *
 * This property ensures the algorithm always halts and provides an upper bound
 * on the number of iterations based on graph size and number of frontiers.
 */
export {};
//# sourceMappingURL=termination.unit.test.d.ts.map