| Safe Haskell | Safe-Inferred |
|---|---|
| Language | GHC2021 |
Data.Graph.BipartiteMatching
Documentation
Arguments
| :: Int | number of vertices |
| -> (forall s. BipartiteMatchingBuilder s -> ST s ()) | |
| -> Int |
data BipartiteMatching s Source #
Constructors
| BipartiteMatching | |
Fields
| |
dfsBM :: PrimMonad m => BipartiteMatching (PrimState m) -> Vertex -> (Bool -> m ()) -> m () Source #
runBipartiteMatching :: PrimMonad m => BipartiteMatching (PrimState m) -> m Int Source #
data BipartiteMatchingBuilder s Source #
Constructors
| BipartiteMatchingBuilder | |
Fields
| |
newBipartiteMatchingBuilder :: PrimMonad m => Int -> m (BipartiteMatchingBuilder (PrimState m)) Source #
addEdgeBMB :: PrimMonad m => BipartiteMatchingBuilder (PrimState m) -> Vertex -> Vertex -> m () Source #
buildBipartiteMatching :: PrimMonad m => BipartiteMatchingBuilder (PrimState m) -> m (BipartiteMatching (PrimState m)) Source #