Uses of Class
net.sf.tweety.commons.util.DigraphNode

Packages that use DigraphNode

Package	Description
net.sf.tweety.arg.aba
net.sf.tweety.arg.aspic.syntax
net.sf.tweety.commons.util
net.sf.tweety.commons.util.rules

Uses of DigraphNode in net.sf.tweety.arg.aba

Methods in net.sf.tweety.arg.aba with parameters of type DigraphNode

Modifier and Type	Method and Description
private Deduction<T>	ABATheory.createDeduction(DigraphNode<ABARule<T>> node, java.util.Set<Deduction<T>> set) Recursively creates a deduction and all of its subdeductions

Uses of DigraphNode in net.sf.tweety.arg.aspic.syntax

Constructors in net.sf.tweety.arg.aspic.syntax with parameters of type DigraphNode

Constructor and Description
AspicArgument(DigraphNode<InferenceRule<T>> node, java.util.Collection<AspicArgument<T>> as) Creates an new argument with and all of its subarguments and adds them to as

Uses of DigraphNode in net.sf.tweety.commons.util

Fields in net.sf.tweety.commons.util with type parameters of type DigraphNode

Modifier and Type	Field and Description
private java.util.Collection<DigraphNode<T>>	DigraphNode.children nodes with edges from/to this node
private java.util.Collection<DigraphNode<T>>	Digraph.nodes the grsph's nodes
private java.util.Collection<DigraphNode<T>>	DigraphNode.parents nodes with edges from/to this node

Methods in net.sf.tweety.commons.util that return DigraphNode

Modifier and Type	Method and Description
DigraphNode<T>	Digraph.addNode(T val)
DigraphNode<T>	DigraphNode.getParent() a parent is a node n, that has an edge leading from n to this node

Methods in net.sf.tweety.commons.util that return types with arguments of type DigraphNode

Modifier and Type	Method and Description
java.util.Collection<DigraphNode<T>>	DigraphNode.getChildren() a child is a node n, that has an edge leading from this node to n
java.util.Collection<DigraphNode<T>>	Digraph.getLeafs() leaves are nodes with an outdegree of 0
java.util.Collection<DigraphNode<T>>	DigraphNode.getParents() a parent is a node n, that has an edge leading from n to this node
java.util.Collection<DigraphNode<T>>	Digraph.getRoots() roots are nodes with an indegree of 0
java.util.Iterator<DigraphNode<T>>	Digraph.iterator()

Methods in net.sf.tweety.commons.util with parameters of type DigraphNode

Modifier and Type	Method and Description
void	DigraphNode.addEdge(DigraphNode<T> to) adds an edge from this node to another node
private void	Digraph.printNode(java.io.PrintStream os, DigraphNode<T> node, int tab) prints a node
void	Digraph.printTree(java.io.OutputStream os, DigraphNode<T> root) prints a tree

Uses of DigraphNode in net.sf.tweety.commons.util.rules

Method parameters in net.sf.tweety.commons.util.rules with type arguments of type DigraphNode

Modifier and Type	Method and Description
private boolean	DerivationGraph.containsNode(R value, java.util.List<DigraphNode<R>> parents)