# Uses of Interface
edu.claflin.finder.logic.processor.Processable

Packages that use Processable
Package
Description
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
edu.claflin.finder.logic.processor
Contains classes related directly to processing.

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

  Classes in edu.claflin.finder.algo that implement Processable
  Modifier and Type
  Class
  Description
  `class`
  `Algorithm`
  Abstraction of the algorithm classes used for finding subgraphs.
  `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.

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

  Classes in edu.claflin.finder.algo.clustering that implement Processable
  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 Processable in edu.claflin.finder.algo.shortestpath

  Classes in edu.claflin.finder.algo.shortestpath that implement Processable
  Modifier and Type
  Class
  Description
  `class`
  `DijkstraShortestPath`
  `class`
  `ShortestPath`

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

  Classes in edu.claflin.finder.algo.spanningtree that implement Processable
  Modifier and Type
  Class
  Description
  `class`
  `ExtremumSpanningTree`
  `class`
  `Kruskal`
  `class`
  `Prim`

- ## Uses of Processable in edu.claflin.finder.logic.processor

  Methods in edu.claflin.finder.logic.processor with parameters of type Processable
  Modifier and Type
  Method
  Description
  `ArrayList<ArrayList<S>>`
  BatchProcessor.`processMultiple(T[] toProcess, Processable<T,S> processor)`
  Processes multiple files.
  `ArrayList<S>`
  BatchProcessor.`processSingular(T toProcess, Processable<T,S> processor)`
  Processes a singular object.