class BipartiteMatching
- BipartiteMatching
- Reference
- Object
Included Modules
- Enumerable(UnweightedEdge2)
- Iterable(UnweightedEdge2)
Defined in:
graph/bipartite_matching.crConstructors
Instance Method Summary
- #<<(edge : UnweightedEdge2) : self
- #<<(edge : Tuple) : self
- #add_edges(edges : Enumerable) : self
-
#each(&) : Nil
Must yield this collection's elements to the block.
-
#each
Must return an
Iteratorover the elements in this collection. - #graph : Array(Array(Int32))
- #left : Int32
- #right : Int32
- #solve : Int32
Instance methods inherited from module Enumerable(UnweightedEdge2)
accumulate(init : U) : Array(U) forall Uaccumulate : Array(T)
accumulate(init : U, &block : U, T -> U) : Array(U) forall U
accumulate(&block : T, T -> T) : Array(T) accumulate, mex : T mex, mex_sorted : T mex_sorted, tally(*, default : Int32) : Hash(T, Int32) tally, unique : self
unique(&) : self unique
Constructor Detail
Instance Method Detail
def each(&) : Nil
#
Description copied from module Enumerable(UnweightedEdge2)
Must yield this collection's elements to the block.
def each
#
Description copied from module Iterable(UnweightedEdge2)
Must return an Iterator over the elements in this collection.