Uses of Class
de.korelstar.math.graph.Node

Packages that use Node

de.korelstar.math.graph	Provides classes for using mathematical graphs.
de.korelstar.mobile.process.parallel.model	The mathematical model used for executing parallel processes.

Uses of Node in de.korelstar.math.graph

Methods in de.korelstar.math.graph that return Node

Node	Edge.getSource()
Node	Edge.getTarget()

Methods in de.korelstar.math.graph with parameters of type Node

void	Graph.addNode(Node n) Adds a node to the graph
boolean	Graph.containsEdge(Node source, Node target) Checks, if the graph contains a certain edge
boolean	EdgesSet.containsEdge(Node source, Node target) Checks, if the graph contains a certain edge
boolean	Graph.containsNode(Node n) Checks, if the graph contains a certain node
boolean	Graph.containsPath(Node source, Node target) Checks, if the graph contains a certain path
java.util.Set	Graph.getCycles(Node start) Get all cycles in the graph, which are on the path from a certain node
Edge	Cycle.getEdge(Node n) Gets the Edge, whose source is a certain Node
Edge	EdgesSet.getEdge(Node source, Node target) Get a specific edge
java.util.Set	EdgesSet.getEdgesWithFrom(Node source) Gets all edges with a specific source
java.util.Set	EdgesSet.getEdgesWithTo(Node target) Gets all edges with a specific target
java.util.Set	Graph.getPredecessors(Node n) Gets the set of nodes, which has a transition to the actual node
java.util.List	Graph.getSerialization(Node from, Node to) Gets a serialization of all Nodes in the range.
boolean	SymmetricEdgesMap.isInRelation(Node a, Node b) Checks, if two Nodes are in relation

Constructors in de.korelstar.math.graph with parameters of type Node

Edge(Node source, Node target)
Creates a directed edge, which connects two nodes

Uses of Node in de.korelstar.mobile.process.parallel.model

Subclasses of Node in de.korelstar.mobile.process.parallel.model

class

Activity An activity of a process.