import { GraphSpec } from '../spec';
import { TestEdge, TestNode, SeededRandom } from './types';
/**
 * Generate complete bipartite K_{m,n} graph.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateCompleteBipartiteEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate bipartite tree (connected, acyclic bipartite graph).
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateBipartiteTreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate connected bipartite graph with even-length cycles.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateBipartiteConnectedEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate bipartite forest (disconnected acyclic bipartite graphs).
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateBipartiteForestEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
/**
 * Generate disconnected bipartite graph with cycles.
 * @param nodes
 * @param edges
 * @param spec
 * @param rng
 */
export declare const generateBipartiteDisconnectedEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
//# sourceMappingURL=bipartite.d.ts.map