# All Classes and Interfaces

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.
AvgBitLength
BatchProcessor<T,S>
Used to process one or multiple objects.
BetweennessCentrality
Computes betweenness centrality for each vertex and edge in the graph.
BinarySearchTree<T extends TreeNodeInfo>
BipartiteCondition
Represents a bipartite graph as a Condition object.
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.
BronKersbochDriver
Bundle
Processes a `Graph` searching for subgraphs.
CliqueCondition
Represents a Clique condition.
ClusteringAlgorithm
CommunicationListener
Communicator
Communities
ComponentsDriver
Condition
Represents a graph condition in memory.
ConditionedGraph
Represents a "conditioned" graph.
ConnectedComponentsDFS
Processes a `Graph` searching for connected components by performing a depth first search.
CygrouperAssembler
CygrouperEdge
CygrouperNode
CytogrouperMain
DepthFirstTraversalSearch
Processes a `Graph` searching for bipartite subgraphs by performing a depth first search on each node.
DijkstraShortestPath
DirectedCliqueCondition
Represents a Directed Clique condition.
DisjointSet<T extends Comparable<T>>
A LinkedList-based Disjoint Set data structure.
Edge
Represents an Edge in memory.
EdgeBetweennessDriver
EdgeWeightComparator
A simple edge weight comparator in which the edge data is considered a numeric value and used as the comparison benchmark.
EigenvalueDecomposition
Eigenvalues and eigenvectors of a real matrix.
ExtremumSpanningTree
FastGreedy
FastGreedy Algorithm for Community Detection.
FastGreedyDriver
FinderDriver
GirvanNewman
Girvan-Newman Algorithm for Community Detection.
Global
Holds "Global" data that needs to be accessed by multiple parts of the program.
Graph
Used to represent a graph in memory.
GraphAverageWeightComparator
GraphReader
Interface used for classes designed to read graphs from memory.
GraphSizeComparator
GraphWriter
Interface used by classes that write graphs to memory.
HeapNodeFG
HeapNodeWT
HuffComparator
HuffmanCode
HuffmanNode
IndexedHeapNode
IndexedHeapQueue
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.
InfomapAlgorithm
InfomapImplementation
InfomapTester
Kruskal
LabelPropagation
TODO: MAKE COMMENTS NICE abc
LabelPropDriver
LeadingEigenvector
Leading Eigenvector Algorithm for Community Detection, following Mark Newman's "Finding community structure in networks using the eigenvectors of matrices".
LeadingEigenvectorAlgorithm
LeadingEigenvectorCaller
LeadingEigenvectorDriver
LogLevel
Enumeration of the logging levels for the user.
LogType
Enumeration of the logging types used by the logging utility.
LogUtil
Logging utility for documenting the state of the program.
Louvain
Louvain algorithm implemented using the brief description by Mark Newman on pages 511-512 of "Networks Second Edition".
LouvainAlgorithm
LouvainDriver
Main
Interprets the command line arguments provided to the program.
ManifestParser
Reads manifest files.
MapBinaryHeap<T>
MapEquation
Maths
Matrix
Jama = Java Matrix class.
MatrixPatternAnalyzer
Deprecated.
No replacement yet.
ModuleNode
NOABatchIO
A class for writing graphs in the NOA batch format.
Node
Represents a node in memory.
Prim
PrioritySet<T>
Represents a PrioritySet.
Processable<T,S>
Represents an operation that can be carried out on a specific type of data.
RelativeUndirectedBitLength
ShortestPath
SIFGraphIO
A class for reading and writing graphs in the SIF format.
SimpleGraphIO
A class for reading and writing graphs.
SpanningTreeDriver
SparseMatrix
SparseMatrix is a sparse matrix with row format.
Tester
Tester
Tester
TreeNode<T extends TreeNodeInfo>
The basic unit of the BinarySearchTree.
TreeNodeInfo
TreeNodeInfoFG
UndirectedTest
VectorValue
Walktrap
Walktrap Algorithm for Community Detection.
WalktrapDriver