Uses of Interface
net.sf.tweety.graphs.Node

Packages that use Node

Package	Description
net.sf.tweety.arg.aba.syntax
net.sf.tweety.arg.aspic.syntax
net.sf.tweety.arg.bipolar.syntax
net.sf.tweety.arg.deductive.semantics
net.sf.tweety.arg.deductive.syntax
net.sf.tweety.arg.dung.syntax
net.sf.tweety.arg.saf.syntax
net.sf.tweety.graphs
net.sf.tweety.graphs.util
net.sf.tweety.logics.bpm.syntax

Uses of Node in net.sf.tweety.arg.aba.syntax

Classes in net.sf.tweety.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 net.sf.tweety.arg.aspic.syntax

Classes in net.sf.tweety.arg.aspic.syntax that implement Node

Modifier and Type	Class	Description
class	AspicArgument<T extends Invertable>

Uses of Node in net.sf.tweety.arg.bipolar.syntax

Subinterfaces of Node in net.sf.tweety.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 net.sf.tweety.arg.bipolar.syntax that implement Node

Modifier and Type	Class	Description
class	ArgumentSet	This class models a set of arguments used by 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	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.

Methods in net.sf.tweety.arg.bipolar.syntax with parameters of type Node

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

Uses of Node in net.sf.tweety.arg.deductive.semantics

Classes in net.sf.tweety.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 net.sf.tweety.arg.deductive.syntax

Classes in net.sf.tweety.arg.deductive.syntax that implement Node

Modifier and Type	Class	Description
class	SimplePlLogicArgument

Uses of Node in net.sf.tweety.arg.dung.syntax

Classes in net.sf.tweety.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.

Methods in net.sf.tweety.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.

Methods in net.sf.tweety.arg.dung.syntax with parameters of type Node

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

Uses of Node in net.sf.tweety.arg.saf.syntax

Classes in net.sf.tweety.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 net.sf.tweety.graphs

Classes in net.sf.tweety.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.
class	Edge<T extends Node>	Instances of this class represent abstract edges.
interface	Graph<T extends Node>	Common interface for graphs with nodes of type T
class	UndirectedEdge<T extends Node>	Instances of this class represent undirected edges.
class	WeightedDirectedEdge<S extends Node,T extends java.lang.Number>
interface	WeightedEdge<S extends Node,T extends java.lang.Number>	Interface for weighted edges.

Classes in net.sf.tweety.graphs that implement Node

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

Methods in net.sf.tweety.graphs with type parameters of type Node

Modifier and Type	Method	Description
static <S extends Node> boolean	DefaultGraph.containsBackEdge(Node parent, java.util.Map<Node,java.lang.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> java.util.Collection<Graph<S>>	DefaultGraph.getComponents(Graph<S> g)	Finds all components of a graph.
static <S extends Node> java.util.Set<java.util.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> java.util.Set<java.util.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> java.util.Collection<Graph<S>>	DefaultGraph.getInducedSubgraphs(Graph<S> g)	Finds all induced subgraphs.
static <S extends Node> java.util.Collection<java.util.Collection<S>>	DefaultGraph.getStronglyConnectedComponents(Graph<S> g)	Returns the strongly connected components of the given graph.
static <S extends Node> java.util.Collection<Graph<S>>	DefaultGraph.getSubgraphs(Graph<S> g)	Returns the set of sub graphs of the given graph.

Methods in net.sf.tweety.graphs with parameters of type Node

Modifier and Type	Method	Description
static <S extends Node> boolean	DefaultGraph.containsBackEdge(Node parent, java.util.Map<Node,java.lang.Integer> states, Graph<S> g)	Helper method for detecting cycles using depth-first search.
java.util.Collection<T>	DefaultGraph.getChildren(Node node)
java.util.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.
java.util.Collection<T>	DefaultGraph.getParents(Node node)
java.util.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.

Method parameters in net.sf.tweety.graphs with type arguments of type Node

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

Uses of Node in net.sf.tweety.graphs.util

Methods in net.sf.tweety.graphs.util with type parameters of type Node

Modifier and Type	Method	Description
static <T extends Node> java.util.Map<T,java.lang.Double>	GraphUtil.betweennessCentralityNormalised(Graph<T> graph)	Computes the normalised betweenness centrality of all nodes, i.e.
static <T extends Node> java.util.Collection<java.util.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> int	GraphUtil.undirecteddiameter(Graph<T> g)	Returns the (undirected) diameter of the graph, i.e.

Methods in net.sf.tweety.graphs.util with parameters of type Node

Modifier and Type	Method	Description
static java.lang.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 java.lang.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 net.sf.tweety.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 java.lang.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 java.lang.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 net.sf.tweety.logics.bpm.syntax

Classes in net.sf.tweety.logics.bpm.syntax that implement Node

Modifier and Type	Class	Description
class	Activity
class	BpmnNode
class	EndEvent
class	Event
class	Gateway
class	IntermediateEvent
class	StartEvent
class	Subprocess
class	Task

Methods in net.sf.tweety.logics.bpm.syntax with parameters of type Node

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