Open Sidebar
Close Sidebar
CrystalDoc.info
Source code
Shards.info
crystalg
0.1.0
Top Level Namespace
Crystalg
DataStructures
FenwickTree
FenwickTree2D
KDTree
LeftistHeap
LinkCutTree
NodeID
PersistentUnionFind
NodeID
PriorityQueue
Queue
RandomizedBinarySearchTree
Node
RandomizedMeldableHeap
SegmetTree
SkewHeap
SkipList
Stack
UnionFind
Geometry
CCW
Circle
Line
Point
Polygon
Containment
Segment
Graph
ConnectedComponents
ArticulationPoints
Bridges
CycleDetection
Dinic
DirectedGraph
Edge
FlowEdge
FlowGraph
FordFulkerson
Graph
HopcroftKarp
NodeID
ShortestPath
Dijkstra
SpanningTree
Kruskal
UndirectedGraph
WeightedFlowEdge
NumberTheory
Fraction
Mod
SternBrocotTree
Random
Xor128
Strings
AhoCorasick
Node
BakerBird
RollingHash
SuffixArray
Float
Built with Crystal 1.9.2
2023-10-08 10:01:00 UTC
class
Crystalg::Graph::HopcroftKarp
Crystalg::Graph::HopcroftKarp
Reference
Object
Defined in:
crystalg/graph/flow/hopcroft_karp.cr
Constructors
.new
(left_size : Int32, right_size : Int32)
Instance Method Summary
#add_edge
(left_id : Int32, right_id : Int32)
#bipartite_matching
Constructor Detail
def self.
new
(left_size : Int32, right_size : Int32)
#
[
View source
]
Instance Method Detail
def
add_edge
(left_id : Int32, right_id : Int32)
#
[
View source
]
def
bipartite_matching
#
[
View source
]