|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
VisualizableGraphComponent
interface.ContinuousMatchingProcess.MatchNotificationReceiver as target for notifications for new matches below or with a
specified k (see Match.
NodeP instances (see
addNode(NodeP, boolean)).
NodeP instances if required.
RepresentationElement) to the list of active
representations.
content.
TextRepresentationElement.toString().
TextRepresentationElement.toString().
TextRepresentationElement.toString().
EdgeP is an edge that is part of a GraphPattern and may be generic (used in graph matching to one
or a series of more edges).SimpleEdge.
true if the transaction is empty (no operation contained).
GraphMatcherQuick.getNextMatch(), satisfactory matches are searched in the list of existing matches.
Match.Candidacy).
toString functions.
toString function.
GraphMatcherQuick instance for the specified graph and pattern.
GraphMatcherQuick instance for the specified graph and pattern.
GraphMatchingPlatform for the specified pattern and the current sequence of the
principal graph (not the matching sequence).
GraphMatchingPlatform.incrementSequence().
GraphMatchingPlatform using TrackingGraph instances for the principal graph and
its shadows.GraphMatchingPlatform.PlatformPrincipalGraph and
GraphMatchingPlatform.PlatformShadowGraph that extends TrackingGraph.Node and Edge components.Graph that relies on LinearGraphRepresentation to create a tree of
paths and then displays the tree of paths.RepresentationElement for graphical representations.GraphMatcherQuick (and therefore implements GraphMatchingProcess) to handle
persistent matching -- matching in which the graph changes slightly from time to time.Match comparator with additional features for single-edge matches.Graph instance.Graph instance.Graph instance that this representation will be bound to
throughout its lifecycle.
TrackingGraph.keepHistory, the history of all transactions.
HyperNode instances).Node implementation that represents a node in a hyper graph, i.e.HyperNode instance, by initializing it with its subordinate graph.
GraphMatchingPlatform.incrementSequence() until the matching process (matching sequence) reaches desired sequence of
the principal graph.
GraphMatchingPlatform.incrementSequence() until the matching process is synchronized with the principal graph.
true if the iterator has just been reset.
TextRepresentationElement.Type is a type of edge.
true if it is the first subgraph in the container.
true if it is the last child of the parent.
true if it is the only child of the parent.
true if the graph is a shadow graph, false if it is not the shadow of any other graph.
true if a history should be kept of all performed transactions.
List in which each item corresponds to a level.
Graph structure.LinearGraphRepresentation for the specified graph.
Node structures.Comparator for PathElement instances that sorts the element with the longer distance to a leaf
first.TextRepresentationElement.Type).
GCanvas as a canvas for the representation, and sets the representation to be represented in a
200 units square centered in the origin of the canvas.
Match comparator.Iterator over GraphMatcherQuick.allMatches that keeps is used to remember the already-returned matches.
PriorityQueue of matches that still have merge candidates.
MonitorPack instance to use for performance information and visualization.
MonitorPack instance to use for performance measuring.
GraphMatcherQuick) to handle both
performance evaluation and visualizing tasks.net.xqhs.graphs.matcher.GraphMatcher interface and the
GraphMatcherQuick implementation.GraphMatchingPlatform and related classes.Comparator class for Node instances, that also supports comparison of NodeP
instances by generic index.Graph contained by this node.
NodeP is a node that is part of a GraphPattern and may be generic (used in graph matching to
match any node in the matched graph).NodeP, with an uninitialized index.
NodeP, with a specified index.
NodeP, with a specified label.
LinearGraphRepresentation).Node instance.
LinearGraphRepresentation.PathComparator).
LinearGraphRepresentation.NodeInAlphaComparator).
MultilevelGraphRepresentation.theLevels member, based on MultilevelGraphRepresentation.levelNodes.
buildPaths() in LinearGraphRepresentation.
#put(GraphComponent, Operation), with the exception that it returns the
instance itself.
GraphicalGraphRepresentation, but using a radial layout instead of a top-down
right-to-left one.Graph instance.
TrackingGraph.addAll(Collection).
TextGraphRepresentation.readRepresentation(String), but taking the input from a ContentHolder, leaving any
un-consumed input in the holder.
TextRepresentationElement.readRepresentation(String, TextGraphRepresentation, UnitComponent), but using a content holder
and leaving all un-consumed input in the holder.
ContinuousMatchingProcess when a match is detected that conforms to the
notification settings.
ContinuousMatchingProcess.MatchNotificationReceiver.
HyperNode.toString().
VisualizableGraphComponent instance.GraphMatchingProcess.resetIterator()) and specifies a new k threshold.
MonitorPack instance than previously set does not result in keeping
any information from one monitor to the other, and aggregation of indicators and output will have to be done
manually.
MonitorPack instance to use for monitoring.
Edge instance with the adjacent nodes not set.
MatchingVisualizer instance to use to visualize the matching process.
Edge interface, also inheriting functions from
AbstractVisualizableGraphComponent.Node and Edge elements.Node interface, also inheriting functionality from
AbstractVisualizableGraphComponent.true if and inly if it is single-operation (is not true for empty transactions).
LinearGraphRepresentation.NodeInAlphaComparator.
ContinuousMatchingProcess, unrelated to the platform except for the set of patterns, to
match all patterns against the specified Graph instance.
ContinuousMatchingProcess, unrelated to the platform except for the current sequence of the
Context Graph (not the matching sequence), that matches the context graph against the specified pattern.
GraphRepresentation to create (or read from) a textual representation of a graph.TextGraphRepresentation, such as a node, an edge, a subgraph, a graph.Graph.
List in which each item corresponds to a level.
Graph in DOT format.
Map of GraphComponent →
TrackingGraph.Operation.
String.split(String))
without worries that the characters in the symbol will be taken as special values.
SimpleEdge instance.
TextGraphRepresentation with
default layout parameters.
TextGraphRepresentation with the
specified parameters.
TextGraphRepresentation.displayRepresentation().
TextRepresentationElement.DEFAULT_INDENT, TextRepresentationElement.DEFAULT_INDENT_INCREMENT, TextRepresentationElement.DEFAULT_INDENT_LIMIT).
toString() of the content.
SimpleGraph.toString().
toString output.
GCanvas.
Queue of transactions to perform.
GraphRepresentation objects.
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||