| Safe Haskell | Safe-Inferred |
|---|---|
| Language | GHC2021 |
Data.Graph.Tree.Rerooting
Documentation
rerootingDP :: forall w a m. (Unbox w, Unbox a, Unbox m, Monoid m) => SparseGraph w -> (a -> m) -> (Vertex -> m -> a) -> Vector a Source #
| Safe Haskell | Safe-Inferred |
|---|---|
| Language | GHC2021 |
Data.Graph.Tree.Rerooting
rerootingDP :: forall w a m. (Unbox w, Unbox a, Unbox m, Monoid m) => SparseGraph w -> (a -> m) -> (Vertex -> m -> a) -> Vector a Source #