/**
 * Integration tests for Eulerian graph class
 *
 * Eulerian: has a circuit that visits every edge exactly once.
 * Equivalent: connected graph where all vertices have even degree.
 * Semi-Eulerian: has a trail (not circuit) visiting every edge exactly once.
 */
export {};
//# sourceMappingURL=eulerian.integration.test.d.ts.map