|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Edge | |
---|---|
net.xqhs.graphs.context | The package contains classes and interfaces related to context representation, context patterns, and context matching. |
net.xqhs.graphs.graph | This package contains the definition interfaces and classes for the definition of simple graphs. |
net.xqhs.graphs.matcher | This package contains the definition of the net.xqhs.graphs.matcher.GraphMatcher interface and the
GraphMatcherQuick implementation. |
net.xqhs.graphs.matchingPlatform | This package contains the definition of GraphMatchingPlatform and related classes. |
net.xqhs.graphs.pattern | This package contains the definition of interfaces and implementations for graph patterns. |
net.xqhs.graphs.representation.text | Contains classes for representing graphs in a textual manner, with help from a linearization process. |
Uses of Edge in net.xqhs.graphs.context |
---|
Classes in net.xqhs.graphs.context that implement Edge | |
---|---|
static class |
ContextGraph.ContextEdge
|
Uses of Edge in net.xqhs.graphs.graph |
---|
Classes in net.xqhs.graphs.graph that implement Edge | |
---|---|
class |
SimpleEdge
A simple implementation on the Edge interface, also inheriting functions from
AbstractVisualizableGraphComponent . |
Fields in net.xqhs.graphs.graph with type parameters of type Edge | |
---|---|
protected java.util.Set<Edge> |
SimpleGraph.edges
The edges |
(package private) java.util.Set<Edge> |
SimpleGraph.NodeData.inEdges
Incoming edges. |
(package private) java.util.Set<Edge> |
SimpleGraph.NodeData.outEdges
Outgoing edges. |
Methods in net.xqhs.graphs.graph that return types with arguments of type Edge | |
---|---|
java.util.Collection<Edge> |
SimpleGraph.getEdges()
|
java.util.Collection<Edge> |
Graph.getEdges()
|
java.util.Set<Edge> |
SimpleGraph.NodeData.getInEdges()
Retrieves incoming edges. |
java.util.Collection<Edge> |
SimpleGraph.getInEdges(Node node)
|
java.util.Collection<Edge> |
Graph.getInEdges(Node node)
Retrieves the edges going into the specified node. |
java.util.Set<Edge> |
SimpleGraph.NodeData.getOutEdges()
Retrieves outgoing edges. |
java.util.Collection<Edge> |
SimpleGraph.getOutEdges(Node node)
|
java.util.Collection<Edge> |
Graph.getOutEdges(Node node)
Retrieves the edges outgoing from the specified node. |
Methods in net.xqhs.graphs.graph with parameters of type Edge | |
---|---|
SimpleGraph |
SimpleGraph.addEdge(Edge edge)
Warning: the function will not add the nodes to the graph, only the edge between them. |
Graph |
Graph.addEdge(Edge edge)
|
SimpleGraph |
SimpleGraph.removeEdge(Edge edge)
|
Graph |
Graph.removeEdge(Edge edge)
|
Constructor parameters in net.xqhs.graphs.graph with type arguments of type Edge | |
---|---|
SimpleGraph.NodeData(java.util.Set<Edge> in,
java.util.Set<Edge> out)
Default constructor. |
|
SimpleGraph.NodeData(java.util.Set<Edge> in,
java.util.Set<Edge> out)
Default constructor. |
Uses of Edge in net.xqhs.graphs.matcher |
---|
Fields in net.xqhs.graphs.matcher with type parameters of type Edge | |
---|---|
(package private) java.util.Map<Edge,java.util.List<Edge>> |
Match.edgeFunction
The correspondence (edge) function EmP -> E' |
(package private) java.util.Map<Edge,java.util.List<Edge>> |
Match.edgeFunction
The correspondence (edge) function EmP -> E' |
Methods in net.xqhs.graphs.matcher that return types with arguments of type Edge | |
---|---|
java.util.List<Edge> |
Match.getMatchedGraphEdges(Edge patternEdge)
Retrieves the edges in the matched subgraph that correspond to the specified edge from the solved part. |
Methods in net.xqhs.graphs.matcher with parameters of type Edge | |
---|---|
protected Match |
GraphMatcherQuick.addInitialMatch(Edge e,
Edge eP,
java.lang.String matchID)
Create a single-edge match and add it to the matching queue; also add matches from the queue to its merge candidate list (as well as adding the match to other matches' merge candidates) |
int |
GraphMatcherQuick.EdgeComparator.compare(Edge e1,
Edge e2)
|
java.util.List<Edge> |
Match.getMatchedGraphEdges(Edge patternEdge)
Retrieves the edges in the matched subgraph that correspond to the specified edge from the solved part. |
protected boolean |
GraphMatcherQuick.isMatch(Edge eP,
Edge e)
Test the match between two edges: matching from and to nodes, matching label. |
Method parameters in net.xqhs.graphs.matcher with type arguments of type Edge | |
---|---|
Match.Candidacy |
Match.considerCandidate(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks if the given match is a merge candidate for this match, and if it is, the matches are added to the merge candidate lists of each other. |
Match.Candidacy |
Match.considerCandidate(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks if the given match is a merge candidate for this match, and if it is, the matches are added to the merge candidate lists of each other. |
Match.Candidacy |
Match.getCandidacy(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks whether another match can be considered as a candidate for merger with this match, and, if yes, what kind (see Match.Candidacy ). |
Match.Candidacy |
Match.getCandidacy(Match mc,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
The method checks whether another match can be considered as a candidate for merger with this match, and, if yes, what kind (see Match.Candidacy ). |
Match |
Match.merge(Match m1,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
Merges two matches into a new one and returns the result. |
Match |
Match.merge(Match m1,
java.util.Map<Edge,java.util.Set<Match>> eMatchIndex,
java.util.Map<Edge,java.util.Set<Match>> ePMatchIndex,
MonitorPack monitor)
Merges two matches into a new one and returns the result. |
Constructors in net.xqhs.graphs.matcher with parameters of type Edge | |
---|---|
Match(Graph g,
GraphPattern p,
Edge e,
Edge eP,
java.lang.String id)
Create a match, using an initial matching edge. |
Uses of Edge in net.xqhs.graphs.matchingPlatform |
---|
Fields in net.xqhs.graphs.matchingPlatform with type parameters of type Edge | |
---|---|
protected java.util.Map<Edge,java.util.Set<Match>> |
GraphMatcherPersistent.eMatchIndex
An index containing the matches that contain each graph edge. |
protected java.util.Map<Edge,java.util.Set<Match>> |
GraphMatcherPersistent.ePMatchIndex
An index containing the matches that contain each pattern edge. |
Methods in net.xqhs.graphs.matchingPlatform with parameters of type Edge | |
---|---|
protected Match |
GraphMatcherPersistent.addInitialMatch(Edge e,
Edge eP,
java.lang.String matchID)
|
GraphMatcherPersistent |
GraphMatcherPersistent.addMatches(Edge e)
The method should be called for each new edge added to the graph. |
GraphMatcherPersistent |
GraphMatcherPersistent.removeMatches(Edge edge)
The method should be called for each edge removed from the graph. |
Uses of Edge in net.xqhs.graphs.pattern |
---|
Classes in net.xqhs.graphs.pattern that implement Edge | |
---|---|
class |
EdgeP
The 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). |
Uses of Edge in net.xqhs.graphs.representation.text |
---|
Classes in net.xqhs.graphs.representation.text that implement Edge | |
---|---|
(package private) class |
SettableEdge
A utility class that allows the from and to nodes to be set separately. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |