The 'APShortestPath' class is used to solve shortest path problems for graphs stored in matrices.
This class provides a data structure Directed Acyclic Graphs (DAGs) with colored nodes.
This class provides a data structure for multi-way trees with colored nodes.
The 'Cycle' class provides a means for building a precedence/directed graph and checking it for cycles.
The 'DualIso' class provides an implementation for Subgraph Isomorphism that uses Dual Graph Simulation for pruning.
The 'DualSim' classs provides an implementation for Dual Graph Simulation.
The 'DualSim2' class provides a second implementation for Dual Graph Simulation.
The 'Graph' class stores vertex-labeled directed graphs using an adjacency set ('adj') representation, e.
The 'GraphSim' class provides an implementation for Simple Graph Simulation.
The 'GraphSim2' class provides a second implementation for Simple Graph Simulation.
The IsomorphismChecker trait check the validity of the isomorphic matches between the query graph 'q' and subgraphs of the data graph 'g'.
The 'PatternMatcher' abstract class serves as a template for implementing specific algorithms for graph pattern matching.
The 'SSShortestPath' class is used to solve shortest path problems for graphs stored in matrices.
This class is for a node in the color tree.
This 'UllmannIso' object provides an implementation for Subgraph Isomorphism that uses an adjacency set version of Ullmann's Algorithm.
The 'APShortestPathTest' object is used to test the 'APShortestPath' class.
An object used to test the ColorDAG class.
This object is used to test the ColorTree class.
The 'CycleTest' object tests the 'Cycle' class using a label-free precedence graph.
The 'DualIsoTest' object is used to test the 'DualIso' class.
The 'DualSim2Test' object is used to test the 'DualSim2' class.
The 'DualSimTest' object is used to test the 'DualSim' class.
The 'Graph' object is the companion object to the 'Graph' class and is used for reading graphs from files or graph databases.
The 'GraphGenerator' object is used to build random graph with various characteristics.
The 'GraphGeneratorTest' object is used to test the 'GraphGenerator' class for building random graphs where a vertex's degree is uniformly distributed.
The 'GraphGeneratorTest' object is used to test the 'GraphGenerator' class for building power law graphs.
The 'GraphGeneratorTest' object is used to test the 'GraphGenerator' class for extracting query graphs from data graphs.
The 'GraphSim2Test' object is used to test the GraphSim2 class.
The 'GraphSimTest' object is used to test the 'GraphSim' class.
This object is used to test the 'Graph' class and object.
The 'PatternMatcherTest' object runs six pattern matching algorithms on the above test graph.
The 'SSShortestPathTest' object is used to test the 'SSShortestPath' class.
The 'PatternMatcherTest' object creates data graph and query graph that can be used to test the results produced by the pattern matching algorithms.
The 'UllmannIsoTest' object is used to test the 'UllmannIso' class.
The graphalytics package contains classes, traits and objects for graph analytics on Trees, DAGs and Directed Graphs.