homepage: http://github.com/GregorySchwartz/hierarchical-spectral-clustering#readme
changelog-type: ''
hash: 25c00d747006c5d2ef9e2763d142affc09663d0998212f18e328c51c4b6e0dee
test-bench-deps: {}
maintainer: gsch@pennmedicine.upenn.edu
synopsis: Hierarchical spectral clustering of a graph.
changelog: ''
basic-deps:
  streaming: -any
  bytestring: -any
  optparse-generic: -any
  clustering: -any
  base: ! '>=4.7 && <5'
  streaming-cassava: -any
  aeson-pretty: -any
  managed: -any
  text: -any
  eigen: ==3.3.4.1
  modularity: -any
  streaming-with: -any
  text-show: -any
  filepath: -any
  tree-fun: -any
  hierarchical-clustering: -any
  spectral-clustering: -any
  containers: -any
  lens: -any
  cassava: -any
  hierarchical-spectral-clustering: -any
  fgl: -any
  mtl: -any
  sparse-linear-algebra: -any
  hmatrix: -any
  streaming-bytestring: -any
  aeson: -any
  safe: -any
  vector: -any
all-versions:
- 0.2.1.0
author: Gregory W. Schwartz
latest: 0.2.1.0
description-type: haddock
description: Generate a tree of hierarchical spectral clustering using Newman-Girvan
  modularity as a stopping criteria.
license-name: GPL-3.0-only

Update from Hackage at 2019-01-10T17:06:31Z
Update from Hackage at 2019-01-10T17:06:31Z
