| Copyright | (c) Ivan Lazar Miljenovic |
|---|---|
| License | MIT |
| Maintainer | Ivan.Miljenovic@gmail.com |
| Safe Haskell | None |
| Language | Haskell2010 |
Data.Graph.Unordered.Algorithms.Components
Description
- components :: ValidGraph et n => Graph et n nl el -> [Graph et n nl el]
- getComponent :: ValidGraph et n => Graph et n nl el -> Maybe (Graph et n nl el, Graph et n nl el)
- getComponentFrom :: ValidGraph et n => Context (AdjType et) n nl el -> Graph et n nl el -> (Graph et n nl el, Graph et n nl el)
Documentation
components :: ValidGraph et n => Graph et n nl el -> [Graph et n nl el] Source
Calculate connected components of a graph; edge directionality doesn't matter.
getComponent :: ValidGraph et n => Graph et n nl el -> Maybe (Graph et n nl el, Graph et n nl el) Source
getComponentFrom :: ValidGraph et n => Context (AdjType et) n nl el -> Graph et n nl el -> (Graph et n nl el, Graph et n nl el) Source