Uses of Interface net.sf.tweety.graphs.Node (Tweety (Graph Library) 1.16 API)

Packages that use Node
Package Description

net.sf.tweety.graphs

net.sf.tweety.graphs.util

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 Number>`
`interface`	`WeightedEdge<S extends Node,T extends 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, 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 and returns them as 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<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(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, Map<Node,Integer> states, Graph<S> g)`	Helper method for detecting cycles using depth-first search.
`Collection<T>`	DefaultGraph.`getChildren(Node 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>`	DefaultGraph.`getParents(Node 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.

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, Map<Node,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> 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> 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 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 net.sf.tweety.graphs.util with type arguments of type Node
Modifier and Type	Method	Description
`static net.sf.tweety.math.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.