Uses of Interface
org.tweetyproject.graphs.Node

Packages that use Node

Package	Description
org.tweetyproject.agents.dialogues
org.tweetyproject.arg.aba.syntax
org.tweetyproject.arg.adf.syntax
org.tweetyproject.arg.aspic.syntax
org.tweetyproject.arg.bipolar.syntax
org.tweetyproject.arg.deductive.semantics
org.tweetyproject.arg.deductive.syntax
org.tweetyproject.arg.dung.causal.syntax
org.tweetyproject.arg.dung.semantics
org.tweetyproject.arg.dung.serialisability.semantics
org.tweetyproject.arg.dung.syntax
org.tweetyproject.arg.saf.syntax
org.tweetyproject.arg.setaf.syntax
org.tweetyproject.graphs
org.tweetyproject.graphs.util
org.tweetyproject.logics.bpm.syntax
org.tweetyproject.logics.petri.syntax
org.tweetyproject.logics.petri.syntax.reachability_graph

Uses of Node in org.tweetyproject.agents.dialogues

Classes in org.tweetyproject.agents.dialogues that implement Node

Modifier and Type	Class	Description
class	ExecutableExtension	This class packs an extension into an executable object.

Uses of Node in org.tweetyproject.arg.aba.syntax

Classes in org.tweetyproject.arg.aba.syntax that implement Node

Modifier and Type	Class	Description
class	Deduction<T extends Formula>	An argument derived from an ABA theory.

Uses of Node in org.tweetyproject.arg.adf.syntax

Classes in org.tweetyproject.arg.adf.syntax that implement Node

Modifier and Type	Class	Description
final class	Argument	An immutable representation of an ADF argument

Uses of Node in org.tweetyproject.arg.aspic.syntax

Classes in org.tweetyproject.arg.aspic.syntax that implement Node

Modifier and Type	Class	Description
class	AspicArgument<T extends Invertable>	An argument according to the ASPIC+ specification

Uses of Node in org.tweetyproject.arg.bipolar.syntax

Subinterfaces of Node in org.tweetyproject.arg.bipolar.syntax

Modifier and Type	Interface	Description
interface	Attack	This interface captures common methods of different interpretations of the attack relation in bipolar abstract argumentation theories.
interface	BipolarEntity	This interface captures common methods of arguments and argument sets of bipolar abstract argumentation theories.
interface	Support	This interface captures common methods of different interpretations of the support relation in bipolar abstract argumentation theories.

Classes in org.tweetyproject.arg.bipolar.syntax that implement Node

Modifier and Type	Class	Description
class	ArgumentSet	This class models a set of arguments used in the context of bipolar abstract argumentation theory.
class	BArgument	This class models an argument used by bipolar abstract argumentation theories.
class	BinaryAttack	This class models a binary attack relation between two arguments.
class	BinarySupport	This class models a support between two arguments.
class	EAttack	Evidential attack used for PEAF and EAF
class	SetAttack	This class models an attack between a set of arguments and an argument.
class	SetSupport	This class models a support between a set of arguments and an argument.
class	WeightedSetSupport	Represents a weighted support relationship between two argument sets.

Methods in org.tweetyproject.arg.bipolar.syntax with parameters of type Node

Modifier and Type	Method	Description
Collection<BArgument>	AbstractBipolarFramework.getChildren(Node node)
Collection<BArgument>	AbstractBipolarFramework.getParents(Node node)

Uses of Node in org.tweetyproject.arg.deductive.semantics

Classes in org.tweetyproject.arg.deductive.semantics that implement Node

Modifier and Type	Class	Description
class	CompilationNode	Instances of this class represent nodes in the compilation of a knowledge base, i.e.
class	DeductiveArgumentNode	Extends a deductive argument by a unique identifier.

Uses of Node in org.tweetyproject.arg.deductive.syntax

Classes in org.tweetyproject.arg.deductive.syntax that implement Node

Modifier and Type	Class	Description
class	SimplePlLogicArgument	Represents a simple propositional logic argument in deductive argumentation.

Uses of Node in org.tweetyproject.arg.dung.causal.syntax

Classes in org.tweetyproject.arg.dung.causal.syntax that implement Node

Modifier and Type	Class	Description
class	InducedArgument	This class is responsible for the representation of an Argument that was induced by a CausalKnowledgeBase Reference: "Argumentation-based Causal and Counterfactual Reasoning" by Lars Bengel, Lydia Blümel, Tjitze Rienstra and Matthias Thimm, published at 1st International Workshop on Argumentation for eXplainable AI (ArgXAI, co-located with COMMA ’22), September 12, 2022

Uses of Node in org.tweetyproject.arg.dung.semantics

Classes in org.tweetyproject.arg.dung.semantics that implement Node

Modifier and Type	Class	Description
class	Extension<T extends ArgumentationFramework<Argument>>	This class models a (possible) extension of a Dung theory, i.e.

Uses of Node in org.tweetyproject.arg.dung.serialisability.semantics

Classes in org.tweetyproject.arg.dung.serialisability.semantics that implement Node

Modifier and Type	Class	Description
class	SerialisationNode	Representation of a 'state' in the serialisation process, consisting of the current DungTheory and a (partial) Extension.

Methods in org.tweetyproject.arg.dung.serialisability.semantics with parameters of type Node

Modifier and Type	Method	Description
Collection<SerialisationNode>	SerialisationGraph.getChildren(Node node)
Collection<SerialisationNode>	SerialisationGraph.getParents(Node node)

Uses of Node in org.tweetyproject.arg.dung.syntax

Classes in org.tweetyproject.arg.dung.syntax that implement Node

Modifier and Type	Class	Description
class	Argument	This class models an argument used by Dung's abstract argumentation theory and is just described by its name.
class	ClaimArgument	an argument with a claim

Methods in org.tweetyproject.arg.dung.syntax with type parameters of type Node

Modifier and Type	Method	Description
<S extends Node> boolean	DungTheory.containsCycle()	Checks whether there is at least one cycle in this DungTheory.
<S extends Node> boolean	DungTheory.containsOddCycle()	Checks whether there is at least on eodd cycle in this DungTheory.

Methods in org.tweetyproject.arg.dung.syntax with parameters of type Node

Modifier and Type	Method	Description
Collection<Argument>	DungTheory.getChildren(Node node)
Collection<Argument>	DungTheory.getParents(Node node)

Uses of Node in org.tweetyproject.arg.saf.syntax

Classes in org.tweetyproject.arg.saf.syntax that implement Node

Modifier and Type	Class	Description
class	ArgumentStructure	This class models an argument structure, i.e.
class	BasicArgument	This class models a basic argument in structured argumentation frameworks, i.e.

Uses of Node in org.tweetyproject.arg.setaf.syntax

Methods in org.tweetyproject.arg.setaf.syntax with type parameters of type Node

Modifier and Type	Method	Description
static <S extends Node> boolean	SetAf.existsDirectedPath(SetAf hyperGraph, Argument node1, Argument node2)	Return whether the path exists

Methods in org.tweetyproject.arg.setaf.syntax with parameters of type Node

Modifier and Type	Method	Description
Collection<Argument>	SetAf.getChildren(Node node)
SetAttack	SetAf.getDirEdge(Set<Argument> node1, Node b)	Return the edge between the two
Collection<Argument>	SetAf.getParents(Node node)

Uses of Node in org.tweetyproject.graphs

Classes in org.tweetyproject.graphs with type parameters of type Node

Modifier and Type	Class	Description
class	DefaultGraph<T extends Node>	Instance of this class represent graphs with nodes of type T
class	DirectedEdge<T extends Node>	Instances of this class represent directed edges.
interface	DirHyperGraph<T extends Node>	Interface for directed hypergraph
class	Edge<T extends Node>	Instances of this class represent abstract edges.
interface	GeneralGraph<T extends Node>	The `GeneralGraph` interface represents a general structure for graphs where each graph consists of nodes and edges.
interface	Graph<T extends Node>	Common interface for graphs with nodes of type T
class	HyperDirEdge<T extends Node>	Instances of this class represent abstract edges.
class	HyperGraph<T extends Node>	This class implements a simple directed hypergraph
class	SimpleGraph<T extends Node>	An extended version of the DefaultGraph which supports removing of nodes as well as some utility functions for d-separation
class	UndirectedEdge<T extends Node>	Instances of this class represent undirected edges.
class	WeightedDirectedEdge<S extends Node,T extends Number>	The `WeightedDirectedEdge` class represents a directed edge between two nodes in a graph, with an associated weight.
interface	WeightedEdge<S extends Node,T extends Number>	Interface for weighted edges.

Classes in org.tweetyproject.graphs that implement Node

Modifier and Type	Class	Description
class	SimpleNode	A simple node of a graph with a name.

Methods in org.tweetyproject.graphs with type parameters of type Node

Modifier and Type	Method	Description
static <S extends Node> boolean	DefaultGraph.containsBackEdge(Node parent, Map<Node,Integer> states, Graph<S> g)	Helper method for detecting cycles using depth-first search.
static <S extends Node> boolean	DefaultGraph.containsCycle(Graph<S> g)	Checks whether there is at least one cycle in the given graph.
static <S extends Node> boolean	DefaultGraph.existsDirectedPath(Graph<S> g, S node1, S node2)	Checks whether there is a (directed) path from node1 to node2 in the given graph.
static <S extends Node> Collection<Graph<S>>	DefaultGraph.getComponents(Graph<S> g)	Finds all components of a graph.
static <S extends Node> Set<Stack<S>>	DefaultGraph.getCyclesExcludingSelfLoops(Graph<S> g)	Finds the cycles of an graph order-sensitively, excluding self-loops (cycles of length one).
static <S extends Node> Set<Stack<S>>	DefaultGraph.getCyclesIncludingSelfLoops(Graph<S> g)	Finds the cycles of an graph order-sensitively, including self-loops (cycles of length one).
static <S extends Node> Collection<Graph<S>>	DefaultGraph.getInducedSubgraphs(Graph<S> g)	Finds all induced subgraphs.
static <S extends Node> Collection<Collection<S>>	DefaultGraph.getStronglyConnectedComponents(Graph<S> g)	* Returns the strongly connected components of the given graph.
static <S extends Node> Collection<Graph<S>>	DefaultGraph.getSubgraphs(GeneralGraph<S> g)	Returns the set of sub graphs of the given graph.
static <S extends Node> boolean	DefaultGraph.isBipartite(Graph<S> g)	checks whether the given graph is bipartite or not the algorithm starts at a random node and colors adjacent nodes in alternating colors if two adjacent nodes have the same color, the graph is no bipartite NOTE: This method only works if the given graph is connected

Methods in org.tweetyproject.graphs with parameters of type Node

Modifier and Type	Method	Description
boolean	HyperGraph.areAdjacent(Node a, Node b)
static <S extends Node> boolean	DefaultGraph.containsBackEdge(Node parent, Map<Node,Integer> states, Graph<S> g)	Helper method for detecting cycles using depth-first search.
Collection<T>	DefaultGraph.getChildren(Node node)
Collection<T>	DirHyperGraph.getChildren(Node node)	Returns the set of children (node connected via an undirected edge or a directed edge where the given node is the parent) of the given node.
Collection<T>	Graph.getChildren(Node node)	Returns the set of children (node connected via an undirected edge or a directed edge where the given node is the parent) of the given node.
Collection<T>	HyperGraph.getChildren(Node node)
HyperDirEdge<T>	HyperGraph.getDirEdge(Set<T> node1, Node b)	Get a directed edge.
Edge<T>	HyperGraph.getEdge(Node a, Node b)
Collection<T>	HyperGraph.getNeighbors(Node node)
Collection<T>	DefaultGraph.getParents(Node node)
Collection<T>	DirHyperGraph.getParents(Node node)	Returns the set of parents (node connected via an undirected edge or a directed edge where the given node is the child) of the given node.
Collection<T>	Graph.getParents(Node node)	Returns the set of parents (node connected via an undirected edge or a directed edge where the given node is the child) of the given node.
Collection<T>	HyperGraph.getParents(Node node)	returns all parents without taking indivdual attacks into account

Method parameters in org.tweetyproject.graphs with type arguments of type Node

Modifier and Type	Method	Description
static <S extends Node> boolean	DefaultGraph.containsBackEdge(Node parent, Map<Node,Integer> states, Graph<S> g)	Helper method for detecting cycles using depth-first search.

Uses of Node in org.tweetyproject.graphs.util

Classes in org.tweetyproject.graphs.util with type parameters of type Node

Modifier and Type	Class	Description
class	GraphPlotter<T extends Node,S extends GeneralEdge<T>>	A generic class for plotting graphs

Methods in org.tweetyproject.graphs.util with type parameters of type Node

Modifier and Type	Method	Description
static <T extends Node> Map<T,Double>	GraphUtil.betweennessCentralityNormalised(Graph<T> graph)	Computes the normalised betweenness centrality of all nodes, i.e.
static <T extends Node> Collection<List<T>>	GraphUtil.enumerateChordlessCircuits(Graph<T> g)	Enumerates all chordless circuits of the given graph, i.e.
static <T extends Node> double	GraphUtil.globalclusteringcoefficient(Graph<T> g)	Returns the global clustering coefficient of the graph (if it is directed it is interpreted as an undirected version).
static <T extends Node> boolean	GraphUtil.isConnected(Graph<T> g)	Returns "true" if the graph is (simply) connected, i.e.
static <T extends Node> int	GraphUtil.undirecteddiameter(Graph<T> g)	* Returns the (undirected) diameter of the graph, i.e.

Methods in org.tweetyproject.graphs.util with parameters of type Node

Modifier and Type	Method	Description
static Double	GraphUtil.hitsRank(Graph<? extends Node> g, Node n, double precision, boolean getAuth)	Computes the HITS rank of the given node in the given graph.
static Double	GraphUtil.pageRank(Graph<? extends Node> g, Node n, double dampingFactor, double precision)	Computes the PageRank of the given node in the given graph.

Method parameters in org.tweetyproject.graphs.util with type arguments of type Node

Modifier and Type	Method	Description
static ComplexNumber[]	GraphUtil.eigenvalues(Graph<? extends Node> g)	Computes the (real parts of the) Eigenvalues of the given graph.
static Double	GraphUtil.hitsRank(Graph<? extends Node> g, Node n, double precision, boolean getAuth)	Computes the HITS rank of the given node in the given graph.
static boolean	GraphUtil.isIsomorphic(Graph<? extends Node> g1, Graph<? extends Node> g2)	Checks whether the two graphs are isomorphic.
static Double	GraphUtil.pageRank(Graph<? extends Node> g, Node n, double dampingFactor, double precision)	Computes the PageRank of the given node in the given graph.

Uses of Node in org.tweetyproject.logics.bpm.syntax

Classes in org.tweetyproject.logics.bpm.syntax that implement Node

Modifier and Type	Class	Description
class	Activity	A class to represent Activities in a BPMN Model
class	BpmnNode	A class to represent all kinds of nodes in a BPMN Model
class	EndEvent	A class to represent end events in a BPMN Model
class	Event	A class to represent events of all kinds in a BPMN Model
class	ExclusiveGateway	A class to represent exclusive gateways in a BPMN Model
class	Gateway	A class to represent gateways of all kinds in a BPMN Model
class	InclusiveGateway	A class to represent inclusive gateways in a BPMN Model
class	IntermediateEvent	A class to represent intermediate events of all kinds in a BPMN Model
class	StartEvent	A class to represent the starting events of a BPMN Model
class	Task	A class to represent tasks in a BPMN Model

Methods in org.tweetyproject.logics.bpm.syntax with parameters of type Node

Modifier and Type	Method	Description
Collection<BpmnNode>	BpmnModel.getChildren(Node node)
Collection<BpmnNode>	BpmnModel.getParents(Node node)

Uses of Node in org.tweetyproject.logics.petri.syntax

Classes in org.tweetyproject.logics.petri.syntax that implement Node

Modifier and Type	Class	Description
class	PetriNetNode	An abstract class for the two types of nodes in a Petri net, places and transitions
class	Place	A class to describe places in a Petri net
class	Transition	A class to describe transitions in a Petri net

Methods in org.tweetyproject.logics.petri.syntax with parameters of type Node

Modifier and Type	Method	Description
Collection<PetriNetNode>	PetriNet.getChildren(Node node)
Collection<PetriNetNode>	PetriNet.getParents(Node node)

Uses of Node in org.tweetyproject.logics.petri.syntax.reachability_graph

Classes in org.tweetyproject.logics.petri.syntax.reachability_graph that implement Node

Modifier and Type	Class	Description
class	Marking	A class to describe markings (i.e.

Methods in org.tweetyproject.logics.petri.syntax.reachability_graph with parameters of type Node

Modifier and Type	Method	Description
Collection<Marking>	ReachabilityGraph.getChildren(Node node)
Collection<Marking>	ReachabilityGraph.getParents(Node node)