# Package edu.claflin.finder.algo

package edu.claflin.finder.algo
Contains the Algorithm code for finding bipartite subgraphs.

- Related Packages
  Package
  Description
  edu.claflin.finder
  Subgraph Finder - Used to find and locate subgraphs within a network.
  edu.claflin.finder.algo.clustering
  edu.claflin.finder.algo.huffman
  edu.claflin.finder.algo.shortestpath
  edu.claflin.finder.algo.spanningtree
  edu.claflin.finder.io
  Contains the input/output code for reading and writing files.
  edu.claflin.finder.log
  Contains the classes used by the programming for logging to a file.
  edu.claflin.finder.logic
  Contains the data structure and processing code-base.
  edu.claflin.finder.struct
- Class
  Description
  Algorithm
  Abstraction of the algorithm classes used for finding subgraphs.
  Algorithm.GraphSortOrder
  ArgumentsBundle
  Used to supply arguments to Algorithms in a generalized manner.
  ArgumentsBundle.COMMON_ARGS
  An enumeration containing common arguments used by the program.
  BreadthFirstTraversalSearch
  Processes a `Graph` searching for subgraphs by performing a breadth first search on each node of the graph.
  BronKerbosch
  Bron-Kersboch Algorithm to find Maximal Cliques and Bicliques.
  Bundle
  Processes a `Graph` searching for subgraphs.
  ConnectedComponentsDFS
  Processes a `Graph` searching for connected components by performing a depth first search.
  DepthFirstTraversalSearch
  Processes a `Graph` searching for bipartite subgraphs by performing a depth first search on each node.
  MatrixPatternAnalyzer
  Deprecated.
  No replacement yet.