# Uses of Class
edu.claflin.finder.algo.Algorithm

Packages that use Algorithm
Package
Description
edu.claflin.finder
Subgraph Finder - Used to find and locate subgraphs within a network.
edu.claflin.finder.algo
Contains the Algorithm code for finding bipartite subgraphs.
edu.claflin.finder.algo.clustering
edu.claflin.finder.algo.shortestpath
edu.claflin.finder.algo.spanningtree

- ## Uses of Algorithm in edu.claflin.finder

  Methods in edu.claflin.finder that return Algorithm
  Modifier and Type
  Method
  Description
  `private static Algorithm`
  Main.`parseAlgorithm(String algorithmCode, HashMap<String,Boolean> config, ArrayList<Condition> conditions, Comparator<Edge> comparator)`
  Parses an algorithm code string for returning the appropriate Algorithm object.

- ## Uses of Algorithm in edu.claflin.finder.algo

  Subclasses of Algorithm in edu.claflin.finder.algo
  Modifier and Type
  Class
  Description
  `class`
  `BreadthFirstTraversalSearch`
  Processes a `Graph` searching for subgraphs by performing a breadth first search on each node of the graph.
  `class`
  `BronKerbosch`
  Bron-Kersboch Algorithm to find Maximal Cliques and Bicliques.
  `class`
  `Bundle`
  Processes a `Graph` searching for subgraphs.
  `class`
  `ConnectedComponentsDFS`
  Processes a `Graph` searching for connected components by performing a depth first search.
  `class`
  `DepthFirstTraversalSearch`
  Processes a `Graph` searching for bipartite subgraphs by performing a depth first search on each node.
  `class`
  `MatrixPatternAnalyzer`
  Deprecated.
  No replacement yet.
  Fields in edu.claflin.finder.algo declared as Algorithm
  Modifier and Type
  Field
  Description
  `private final Algorithm[]`
  Bundle.`algorithms`
  The `Algorithm` array containing the algorithms to process graphs with.
  Constructors in edu.claflin.finder.algo with parameters of type Algorithm
  Modifier
  Constructor
  Description
  ``
  `Bundle(Algorithm[] algorithms)`
  Constructs the Algorithm object.

- ## Uses of Algorithm in edu.claflin.finder.algo.clustering

  Subclasses of Algorithm in edu.claflin.finder.algo.clustering
  Modifier and Type
  Class
  Description
  `class`
  `ClusteringAlgorithm`
  `class`
  `FastGreedy`
  FastGreedy Algorithm for Community Detection.
  `class`
  `GirvanNewman`
  Girvan-Newman Algorithm for Community Detection.
  `class`
  `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.
  `class`
  `LabelPropagation`
  TODO: MAKE COMMENTS NICE abc
  `class`
  `LeadingEigenvector`
  Leading Eigenvector Algorithm for Community Detection, following Mark Newman's "Finding community structure in networks using the eigenvectors of matrices".
  `class`
  `Louvain`
  Louvain algorithm implemented using the brief description by Mark Newman on pages 511-512 of "Networks Second Edition".
  `class`
  `Walktrap`
  Walktrap Algorithm for Community Detection.

- ## Uses of Algorithm in edu.claflin.finder.algo.shortestpath

  Subclasses of Algorithm in edu.claflin.finder.algo.shortestpath
  Modifier and Type
  Class
  Description
  `class`
  `DijkstraShortestPath`
  `class`
  `ShortestPath`

- ## Uses of Algorithm in edu.claflin.finder.algo.spanningtree

  Subclasses of Algorithm in edu.claflin.finder.algo.spanningtree
  Modifier and Type
  Class
  Description
  `class`
  `ExtremumSpanningTree`
  `class`
  `Kruskal`
  `class`
  `Prim`