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.deductive.semantics
net.sf.tweety.arg.dung
net.sf.tweety.arg.dung.syntax
net.sf.tweety.arg.dung.test
net.sf.tweety.arg.saf.syntax
net.sf.tweety.graphs
net.sf.tweety.graphs.orders
net.sf.tweety.graphs.util

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 and Description
class	Deduction<T extends Formula>

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 and Description
class	AspicArgument<T extends Invertable>

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 and 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.dung

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

Modifier and Type	Method and 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.dung.syntax

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

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

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

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

Modifier and Type	Method and Description
static java.lang.Double	AnalysisTest.hitsRankInverted(Graph<? extends Node> g, Node n, double precision, boolean getAuth)
static java.lang.Double	AnalysisTest.pageRankInverted(Graph<? extends Node> g, Node n, double dampingFactor, double precision) Inverted PageRank

Method parameters in net.sf.tweety.arg.dung.test with type arguments of type Node

Modifier and Type	Method and Description
static java.lang.Double	AnalysisTest.hitsRankInverted(Graph<? extends Node> g, Node n, double precision, boolean getAuth)
static java.lang.Double	AnalysisTest.pageRankInverted(Graph<? extends Node> g, Node n, double dampingFactor, double precision) Inverted PageRank

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 and 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 and 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 and Description
class	SimpleNode A simple node of a graph with a name.

Fields in net.sf.tweety.graphs declared as Node

Modifier and Type	Field and Description
private T	Edge.nodeA The first node of this edge.
private T	Edge.nodeB The second node of this edge.

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

Modifier and Type	Method and Description
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<java.util.Collection<S>>	DefaultGraph.getStronglyConnectedComponents(Graph<S> g) Returns the strongly connected components of the given graph.
private static <S extends Node> int	DefaultGraph.getStronglyConnectedComponentsRec(int idx, S v, java.util.Stack<S> stack, java.util.Collection<java.util.Collection<S>> sccs, Graph<S> g, java.util.Map<S,java.lang.Integer> index, java.util.Map<S,java.lang.Integer> lowlink) Main method for computing the strongly connected components using Tarjan's algorithm.
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 and Description
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.getChildren(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.
java.util.Collection<T>	DefaultGraph.getParents(Node node)

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

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

Modifier and Type	Class and Description
private class	Order.OrderNode Represents an object that is ordered.

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

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

Modifier and Type	Field and Description
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>>	GraphUtil.archiveHITSAuthRank For archiving HITS rank values.
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>>	GraphUtil.archiveHITSAuthRank For archiving HITS rank values.
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>>	GraphUtil.archiveHITSHubRank
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>>	GraphUtil.archiveHITSHubRank
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>>>	GraphUtil.archivePageRank For archiving page rank values.
private static java.util.Map<Graph<? extends Node>,java.util.Map<java.lang.Double,java.util.Map<java.lang.Double,java.util.Map<Node,java.lang.Double>>>>	GraphUtil.archivePageRank For archiving page rank values.

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

Modifier and Type	Method and Description
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 and 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 and 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 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.