The APShortestPath
class is used to solve shortest path problems for graphs
stored in matrices.
The Ball
class provides an implementation for ball construction.
The BipartiteMatching
class provides an implementation of finding maximal
Bipartite Matching.
The ColorDAG
class provides a data structure Directed Acyclic Graphs (DAGs) with colored
nodes.
The ColorTree
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 DualSim3
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 Graph2
class is used for representing "Directed Graphs".
The GraphBFS
performs Breadth First Search on a Directed Graph.
The GraphIso
class determines whether two labelled directed graphs are
Graph Isomorphic.
The GraphMetrics
class provides methods for determining graph metrics that
can be efficiently computed using Breadth-First Search (BFS).
The GraphSim
class provides an implementation for Simple Graph Simulation.
The GraphSim2
class provides a second implementation for Simple Graph
Simulation.
The GraphSim3
class provides a second implementation for Simple Graph
Simulation.
This GraphSimIso
object provides an implementation for Subgraph Isomorphism
that uses an adjacency set version of Ullmann's Algorithm.
The 'GraphqlOpt' class provides an implementation for Subgraph Isomorphism of GraphQL's Algorithm.
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 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.
The 'TightSimulation' class provides an implementation for graph pattern matching.
The TreeNode
class is for a node in the color tree.
The APShortestPath
companion object provides factory methods for the
APShortestPath
class.
The APShortestPathTest
object is used to test the APShortestPath
class.
The 'BipartiteMatchingTest' object is used to test BipartiteMatching
class.
The ColorDAGTest
object used to test the ColorDAG
class.
The ColorTreeTest
object is used to test the 'ColorTree
class.
The Convert
object is used to convert between an Adjacency Matrix
representation to an Adjacency Sets representation.
The ConvertTest
object is used to test the Convert
object.
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 DualSim3Test
object is used to test the 'DualSim3' 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 Graph2Test
object is used to test the Graph2
class.
The Graph2Types
specifies type for vertices and vertex labels.
The GraphBFSTest
is used to test the GraphBFS
class.
The GraphGenerator
object is used to build random graph with various
characteristics.
The GraphGenerator2
object is used to build random graph with various
characteristics.
The 'GraphGenerator2Test' object is used to test the 'GraphGenerator2' class for building random graphs where a vertex's degree is uniformly distributed.
The 'GraphGenerator2Test2' object is used to test the 'GraphGenerator2' class for building power law graphs.
The GraphGenerator2Test3
object is used to test the GraphGenerator2
class
for extracting query graphs from data graphs.
The 'GraphGeneratorTest' object is used to test the 'GraphGenerator' class for building random graphs where a vertex's degree is uniformly distributed.
The 'GraphGeneratorTest2' object is used to test the 'GraphGenerator' class for building power law graphs.
The GraphGeneratorTest3
object is used to test the GraphGenerator
class
for extracting query graphs from data graphs.
The GraphIsoTest
object is used to test the GraphIso
class.
The GraphMetricsTest
object is used to test the GraphMetrics
class.
The GraphSim2Test
object is used to test the GraphSim2
class.
The GraphSim3Test
object is used to test the GraphSim3
class.
The GraphSim3Test2
object is used to test the GraphSim3
class.
The GraphSimIsoTest
object is used to test the GraphSimIso
class.
The GraphSimTest
object is used to test the GraphSim
class.
The GraphTest
object is used to test the Graph
class and object.
The GraphTypes
specifies type for vertices and vertex labels.
The GraphqlOptTest
object randomly generates the data graph and corresponding
query graph to test GraphqlOpt class.
The GraphqlOptTest2
object test the GraphqlOpt class by feeding the value
of data graph and query graph.
The GraphqlOptTest3
object test the GraphqlOpt class by feeding data graph and
query graph absolute file path.
The GraphqlOptTest4
object test the GraphqlOpt class by passing data graph and
query graph absolute file path as an argument.
The 'PatternMatcherTest' object runs six pattern matching algorithms on the above test graph.
The SSShortestPath
companion object provides factory methods for the
APShortestPath
class.
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 TightSimulationTest
object test the TightSimulation
class by passing
data graph, query graph absolute file path, print match/ball (0/1)
The TightSimulationTest2
object test the TightSimulation
class by feeding
data graph, query graph absolute file path, print match/ball (0/1).
The graphalytics package contains classes, traits and objects for graph analytics on Trees, DAGs and Directed Graphs.