ClassDescriptionSimple graph that models the gMark graph configuration.DataProxy<T>Class that can be used as a wrapper around some other object.The edge graph is a graph constructed from an input graph such that all edges in the original input graph are nodes in the edge graph.Class to represent data stored in the edge graph.Represents metadata for the edge graph source and target nodes.Data representing identity.Metadata representing the intersection of two paths.Represents data for a normal graph node constructed from a schema graph edge.GraphPanel<V,
E>Simple component that visualises the nodes and edges in a
UniqueGraph.Interface to represent objects that are associated with some unique ID.Writes that prefixes all lines with a configurable number of spaces and can be converted to a string once all content has been written.Path segment modelling a single edge of a path drawn in the selectivity graph.RangeList<T>A list implementation backed by a fixed size array.RangeMatrix<T>A matrix implementation backed by a fixed size 2 dimensional array.The schema graph is a graph that has selectivity types as its nodes.The selectivity graph is a directed graph between
selectivity types.Matrix that encoder pair wise information for all selectivity types in a graph.Implementation of a simple graph that only supports unlabelled undirected edges.Represents a single undirected edge between two nodes in the graph.Represents a single vertex in the graph.Tree<T>Implementation of a tree data structure where data can be stored at each node in the tree and each tree node can have any number of child nodes.Interface for tree traversal implementations.UniqueGraph<V,
E>Utility class to model a graph with directed edges.Represents a single directed edge in the graph that can have associated data.Represents a single node in the graph that is uniquely identifiable by some data.Class providing various small utilities as well as thread bound random operations.