Uses of Interface
net.sf.tweety.graphs.Node
-
-
-
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.adf.syntax
Classes in net.sf.tweety.arg.adf.syntax that implement Node Modifier and Type Class Description class
Argument
An immutable representation of an ADF argument -
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.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>
booleanDungTheory. 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 Tclass
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 Tclass
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.Fields in net.sf.tweety.graphs declared as Node Modifier and Type Field 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 Description private static <S extends Node>
java.lang.BooleanDefaultGraph. circuit(S v, java.util.Stack<S> stack, java.util.Map<S,java.lang.Boolean> blocked, java.util.Map<S,java.util.Set<S>> ak, java.util.Map<S,java.util.Set<S>> b, S s, java.util.Set<java.util.Stack<S>> results)
static <S extends Node>
booleanDefaultGraph. 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>
booleanDefaultGraph. containsCycle(Graph<S> g)
Checks whether there is at least one cycle in the given graph.static <S extends Node>
booleanDefaultGraph. 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 and returns them as 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<java.util.Collection<S>>DefaultGraph. getStronglyConnectedComponents(Graph<S> g)
Returns the strongly connected components of the given graph.private static <S extends Node>
intDefaultGraph. 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.private static <S extends Node>
voidDefaultGraph. unblock(S u, java.util.Map<S,java.lang.Boolean> blocked, java.util.Map<S,java.util.Set<S>> b)
Methods in net.sf.tweety.graphs with parameters of type Node Modifier and Type Method Description static <S extends Node>
booleanDefaultGraph. 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>
booleanDefaultGraph. 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.orders
Classes in net.sf.tweety.graphs.orders that implement Node Modifier and Type Class 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 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 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>
doubleGraphUtil. 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>
intGraphUtil. 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.
-