Package dev.roanh.gmark.util

package dev.roanh.gmark.util
  • Class
    Description
    ConfigGraph
    Simple graph that models the gMark graph configuration.
    DataProxy<T>
    Class that can be used as a wrapper around some other object.
    EdgeGraph
    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.
    EdgeGraphData
    Class to represent data stored in the edge graph.
    EdgeGraphData.EndpointData
    Represents metadata for the edge graph source and target nodes.
    EdgeGraphData.IdentityData
    Data representing identity.
    EdgeGraphData.IntersectionData
    Metadata representing the intersection of two paths.
    EdgeGraphData.PredicateData
    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.
    IDable
    Interface to represent objects that are associated with some unique ID.
    IndentWriter
    Writes that prefixes all lines with a configurable number of spaces and can be converted to a string once all content has been written.
    PathSegment
    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.
    SchemaGraph
    The schema graph is a graph that has selectivity types as its nodes.
    SelectivityGraph
    The selectivity graph is a directed graph between selectivity types.
    SelectivityGraph.DistanceMatrix
    Matrix that encoder pair wise information for all selectivity types in a graph.
    SelectivityType
    Selectivity types are a combination of a node type and selectivity class.
    SimpleGraph<T extends IDable,M>
    Implementation of a simple graph that only supports unlabelled undirected edges.
    SimpleGraph.SimpleEdge<T extends IDable,M>
    Represents a single undirected edge between two nodes in the graph.
    SimpleGraph.SimpleVertex<T extends IDable,M>
    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.
    Tree.TreeVisitor<T>
    Interface for tree traversal implementations.
    UniqueGraph<V,E>
    Utility class to model a graph with directed edges.
    UniqueGraph.GraphEdge<V,E>
    Represents a single directed edge in the graph that can have associated data.
    UniqueGraph.GraphNode<V,E>
    Represents a single node in the graph that is uniquely identifiable by some data.
    Util
    Class providing various small utilities as well as thread bound random operations.