| Copyright | (c) Ivan Lazar Miljenovic |
|---|---|
| License | MIT |
| Maintainer | Ivan.Miljenovic@gmail.com |
| Safe Haskell | None |
| Language | Haskell2010 |
Data.Graph.Unordered.Algorithms.Clustering
Description
- bgll :: (ValidGraph et n, EdgeMergeable et, Fractional el, Ord el) => Graph et n nl el -> [[n]]
- class EdgeType et => EdgeMergeable et
Documentation
bgll :: (ValidGraph et n, EdgeMergeable et, Fractional el, Ord el) => Graph et n nl el -> [[n]] Source #
Find communities in weighted graphs using the algorithm by Blondel, Guillaume, Lambiotte and Lefebvre in their paper Fast unfolding of communities in large networks.