# Package edu.claflin.finder.algo.clustering

package edu.claflin.finder.algo.clustering

- Related Packages
  Package
  Description
  edu.claflin.finder.algo
  Contains the Algorithm code for finding bipartite subgraphs.
  edu.claflin.finder.algo.clustering.struct
  edu.claflin.finder.algo.huffman
  edu.claflin.finder.algo.shortestpath
  edu.claflin.finder.algo.spanningtree
- Classes
  Class
  Description
  ClusteringAlgorithm
  Communities
  FastGreedy
  FastGreedy Algorithm for Community Detection.
  GirvanNewman
  Girvan-Newman Algorithm for Community Detection.
  Infomap
  InfomapImplementation algorithm implemented using Mapping Higher-Order Network Flows in Memory and Multilayer Networks with InfomapImplementation by Daniel Edler, Ludvig Bohlin and Martin Rosvall.
  LabelPropagation
  TODO: MAKE COMMENTS NICE abc
  LeadingEigenvector
  Leading Eigenvector Algorithm for Community Detection, following Mark Newman's "Finding community structure in networks using the eigenvectors of matrices".
  Louvain
  Louvain algorithm implemented using the brief description by Mark Newman on pages 511-512 of "Networks Second Edition".
  Walktrap
  Walktrap Algorithm for Community Detection.