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

Packages that use Graph

Package	Description
net.sf.tweety.graphs
net.sf.tweety.graphs.util

Uses of Graph in net.sf.tweety.graphs

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

Modifier and Type	Class	Description
class	DefaultGraph<T extends Node>	Instance of this class represent graphs with nodes of type T

Methods in net.sf.tweety.graphs that return Graph

Modifier and Type	Method	Description
Graph<T>	DefaultGraph.getComplementGraph(int selfloops)
Graph<T>	Graph.getComplementGraph(int selfloops)	Returns the complement graph of this graph, i.e.
Graph<T>	Graph.getRestriction(Collection<T> nodes)	Returns copy of this graph consisting only of the given nodes and all corresponding edges.

Methods in net.sf.tweety.graphs that return types with arguments of type Graph

Modifier and Type	Method	Description
static <S extends Node> Collection<Graph<S>>	DefaultGraph.getComponents(Graph<S> g)	Finds all components of a graph and returns them as a graph.
Collection<Graph<T>>	DefaultGraph.getSubgraphs()
static <S extends Node> Collection<Graph<S>>	DefaultGraph.getSubgraphs(Graph<S> g)	Returns the set of sub graphs of the given graph.
Collection<Graph<T>>	Graph.getSubgraphs()	Returns the set of sub graphs of this graph.

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

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.

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

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

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 net.sf.tweety.math.ComplexNumber[]	GraphUtil.eigenvalues(Graph<? extends Node> g)	Computes the (real parts of the) Eigenvalues of the given graph.
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 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.
static <T extends Node> int	GraphUtil.undirecteddiameter(Graph<T> g)	Returns the (undirected) diameter of the graph, i.e.