/**
 * Integration tests for Chordal graph class
 *
 * Chordal: every cycle of length >= 4 has a chord (edge between non-adjacent vertices).
 * Equivalent: has a perfect elimination ordering.
 * Examples: trees, complete graphs, interval graphs.
 */
export {};
//# sourceMappingURL=chordal.integration.test.d.ts.map