Uses of Interface
net.xqhs.graphs.graph.Node

Packages that use Node
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.pattern This package contains the definition of interfaces and implementations for graph patterns. 
net.xqhs.graphs.representation.linear Contains necessary classes for representing graphs in a linear manner. 
net.xqhs.graphs.representation.multilevel The package contains interfaces and classes dealing with representing multi-level graphs (graphs in which whole graphs can be represented as nodes in higher-level graphs). 
net.xqhs.graphs.representation.text Contains classes for representing graphs in a textual manner, with help from a linearization process. 
 

Uses of Node in net.xqhs.graphs.context
 

Constructors in net.xqhs.graphs.context with parameters of type Node
ContextGraph.ContextEdge(Node fromNode, Node toNode, java.lang.String edgeLabel, Instant.Offset edgeValidity)
           
 

Uses of Node in net.xqhs.graphs.graph
 

Classes in net.xqhs.graphs.graph that implement Node
 class HyperNode
          The class is a Node implementation that represents a node in a hyper graph, i.e.
 class SimpleNode
          A simple implementation of the Node interface, also inheriting functionality from AbstractVisualizableGraphComponent.
 

Fields in net.xqhs.graphs.graph declared as Node
protected  Node SimpleEdge.from
          The source of the edge.
protected  Node SimpleEdge.to
          The destination of the edge.
 

Fields in net.xqhs.graphs.graph with type parameters of type Node
protected  java.util.Map<Node,SimpleGraph.NodeData> SimpleGraph.nodes
          The nodes
 

Methods in net.xqhs.graphs.graph that return Node
 Node SimpleEdge.getFrom()
           
 Node Edge.getFrom()
           
 Node SimpleEdge.getTo()
           
 Node Edge.getTo()
           
 

Methods in net.xqhs.graphs.graph that return types with arguments of type Node
 java.util.Map<Node,java.lang.Integer> SimpleGraph.computeDistancesFromUndirected(Node node)
          Simple Dijkstra algorithm to compute the distance between one node and all others.
 java.util.Collection<Node> SimpleGraph.getNodes()
           
 java.util.Collection<Node> Graph.getNodes()
           
 java.util.Collection<Node> SimpleGraph.getNodesNamed(java.lang.String name)
           
 java.util.Collection<Node> Graph.getNodesNamed(java.lang.String name)
           
 

Methods in net.xqhs.graphs.graph with parameters of type Node
 SimpleGraph SimpleGraph.addNode(Node node)
           
 Graph Graph.addNode(Node node)
           
 int NodeAlphaComparator.compare(Node n0, Node n1)
           
 java.util.Map<Node,java.lang.Integer> SimpleGraph.computeDistancesFromUndirected(Node node)
          Simple Dijkstra algorithm to compute the distance between one node and all others.
 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.Collection<Edge> SimpleGraph.getOutEdges(Node node)
           
 java.util.Collection<Edge> Graph.getOutEdges(Node node)
          Retrieves the edges outgoing from the specified node.
 SimpleGraph SimpleGraph.removeNode(Node node)
           
 Graph Graph.removeNode(Node node)
           
 

Constructors in net.xqhs.graphs.graph with parameters of type Node
SimpleEdge(Node fromNode, Node toNode, java.lang.String edgeLabel)
          Constructs a new edge.
 

Uses of Node in net.xqhs.graphs.matcher
 

Fields in net.xqhs.graphs.matcher with type parameters of type Node
private  java.util.Map<Node,java.lang.Integer> GraphMatcherQuick.MatchSingleComparator.distances
          Vector of distances between every node and the start vertex.
(package private)  java.util.Map<Node,java.util.concurrent.atomic.AtomicInteger> Match.frontier
          The nodes on the frontier of GmP - nodes that have adjacent edges in ExP.
(package private)  java.util.Map<Node,Node> Match.nodeFunction
          The correspondence (node) function VmP -> V'
(package private)  java.util.Map<Node,Node> Match.nodeFunction
          The correspondence (node) function VmP -> V'
 

Methods in net.xqhs.graphs.matcher that return Node
 Node Match.getMatchedGraphNode(Node patternNode)
          Retrieves the node in the matched subgraph that corresponds to the specified node from the solved part.
 

Methods in net.xqhs.graphs.matcher that return types with arguments of type Node
protected  java.util.Map<Node,java.lang.Integer> GraphMatcherQuick.computeVertexDistances()
          Decides which is the "start vertex" in the pattern (maximum value of in-degree minus out-degree).
 

Methods in net.xqhs.graphs.matcher with parameters of type Node
 Node Match.getMatchedGraphNode(Node patternNode)
          Retrieves the node in the matched subgraph that corresponds to the specified node from the solved part.
 

Constructor parameters in net.xqhs.graphs.matcher with type arguments of type Node
GraphMatcherQuick.MatchSingleComparator(java.util.Map<Node,java.lang.Integer> vertexDistances, MonitorPack monitor)
          Creates a match comparator that uses distances of vertices with respect to the root vertex.
 

Uses of Node in net.xqhs.graphs.pattern
 

Classes in net.xqhs.graphs.pattern that implement Node
 class NodeP
          The 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).
 

Methods in net.xqhs.graphs.pattern with parameters of type Node
 GraphPattern GraphPattern.addNode(Node node)
          Adds a node to the graph, but offers support for indexing NodeP instances (see addNode(NodeP, boolean)).
 GraphPattern GraphPattern.addNode(Node node, boolean doindex)
          Adds a node to the graph, also indexing generic NodeP instances if required.
 

Uses of Node in net.xqhs.graphs.representation.linear
 

Fields in net.xqhs.graphs.representation.linear declared as Node
(package private)  Node PathElement.node
          The node to which this instance is associated.
 

Fields in net.xqhs.graphs.representation.linear with type parameters of type Node
protected  java.util.List<Node> LinearGraphRepresentation.sortedNodes
          The nodes of the graph, as sorted by a LinearGraphRepresentation.NodeInAlphaComparator.
 

Methods in net.xqhs.graphs.representation.linear that return Node
 Node PathElement.getNode()
           
 

Methods in net.xqhs.graphs.representation.linear with parameters of type Node
 int LinearGraphRepresentation.NodeInAlphaComparator.compare(Node n0, Node n1)
           
 

Constructors in net.xqhs.graphs.representation.linear with parameters of type Node
PathElement(Node node, int distance, PathElement parent)
          Creates a new instance, associated with a Node instance.
 

Uses of Node in net.xqhs.graphs.representation.multilevel
 

Fields in net.xqhs.graphs.representation.multilevel with type parameters of type Node
protected  java.util.List<java.util.Map<Node,Node>> MultilevelGraphRepresentation.levelNodes
          A List in which each item corresponds to a level.
protected  java.util.List<java.util.Map<Node,Node>> MultilevelGraphRepresentation.levelNodes
          A List in which each item corresponds to a level.
protected  java.util.List<java.util.Map<Node,Graph>> MultilevelGraphRepresentation.theLevels
          A List in which each item corresponds to a level.
 

Constructor parameters in net.xqhs.graphs.representation.multilevel with type arguments of type Node
MultilevelGraphRepresentation(Graph graph, java.util.List<java.util.Map<Node,Node>> nodeLevels)
          Creates a new multi-level representation, based on the graph containing all nodes and the membership function between levels.
MultilevelGraphRepresentation(Graph graph, java.util.List<java.util.Map<Node,Node>> nodeLevels)
          Creates a new multi-level representation, based on the graph containing all nodes and the membership function between levels.
TextMultilevelGraphRepresentation(Graph graph, java.util.List<java.util.Map<Node,Node>> nodeLevels)
          Creates a new representation.
TextMultilevelGraphRepresentation(Graph graph, java.util.List<java.util.Map<Node,Node>> nodeLevels)
          Creates a new representation.
 

Uses of Node in net.xqhs.graphs.representation.text
 

Methods in net.xqhs.graphs.representation.text with parameters of type Node
protected  SettableEdge SettableEdge.setFrom(Node sourceNode)
           
protected  SettableEdge SettableEdge.setTo(Node destinationNode)