libs.graph.BipartiteGraph

libs.graph.BipartiteGraph

Fields

	Name	Type
	n	I32
	m	I32
	edges	hl.types.ArrayObj
	pairU	hl.types.ArrayBytes_Int
	pairV	hl.types.ArrayBytes_Int
	adj	hl.types.ArrayObj
	_dist	hl.types.ArrayBytes_Int
	_maxDist	I32
static	INF	I32
static	NIL	I32

Protos

• f@33716 reset(libs.graph.BipartiteGraph, I32, I32) → Void
• f@33717 addEdge(libs.graph.BipartiteGraph, I32, I32) → Void
• f@33718 maximumMatching(libs.graph.BipartiteGraph) → hl.types.ArrayObj
• f@33719 minimumVertexCover(libs.graph.BipartiteGraph) → hl.types.ArrayObj
• f@33720 maximumIndependentSet(libs.graph.BipartiteGraph) → hl.types.ArrayObj
• f@33721 bfs(libs.graph.BipartiteGraph) → Bool
• f@33722 dfs(libs.graph.BipartiteGraph, I32) → Bool
• f@33723 walk(libs.graph.BipartiteGraph, hl.types.ArrayBytes_Int, I32, hl.types.ArrayObj, hl.types.ArrayBytes_Int, hl.types.ArrayObj, hl.types.ArrayBytes_Int, hl.types.ArrayObj) → Void

Bindings

• static f@33715 __constructor__(libs.graph.BipartiteGraph, I32, I32) → Void