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

Packages that use Graph

Package	Description
net.sf.tweety.agents.dialogues
net.sf.tweety.agents.dialogues.structured
net.sf.tweety.arg.bipolar.syntax
net.sf.tweety.arg.deductive.semantics
net.sf.tweety.arg.dung.syntax
net.sf.tweety.arg.prob.syntax
net.sf.tweety.arg.saf.syntax
net.sf.tweety.arg.social.syntax
net.sf.tweety.graphs
net.sf.tweety.graphs.util

Uses of Graph in net.sf.tweety.agents.dialogues

Classes in net.sf.tweety.agents.dialogues that implement Graph

Modifier and Type	Class	Description
class	ExecutableDungTheory	This class packs a Dung theory into an executable object.

Uses of Graph in net.sf.tweety.agents.dialogues.structured

Classes in net.sf.tweety.agents.dialogues.structured that implement Graph

Modifier and Type	Class	Description
class	PerceivableStructuredArgumentationFramework	This class packs a structured argumentation framework into a perceivable object.

Uses of Graph in net.sf.tweety.arg.bipolar.syntax

Classes in net.sf.tweety.arg.bipolar.syntax that implement Graph

Modifier and Type	Class	Description
class	BipolarArgFramework	This class implements a bipolar abstract argumentation theory with support in a deductive sense.
class	EvidentialArgSystem	This class implements a bipolar abstract argumentation theory with support in an evidential sense.

Fields in net.sf.tweety.arg.bipolar.syntax with type parameters of type Graph

Modifier and Type	Field	Description
private static java.util.Map<BipolarArgFramework,java.util.Collection<Graph<Argument>>>	BipolarArgFramework.archivedSubgraphs	For archiving sub graphs
private static java.util.Map<BipolarArgFramework,java.util.Collection<Graph<Argument>>>	EvidentialArgSystem.archivedSubgraphs	For archiving sub graphs

Constructors in net.sf.tweety.arg.bipolar.syntax with parameters of type Graph

Constructor	Description
BipolarArgFramework(Graph<Argument> graph)	Creates a new theory from the given graph.
EvidentialArgSystem(Graph<Argument> graph)	Creates a new theory from the given graph.

Uses of Graph in net.sf.tweety.arg.deductive.semantics

Classes in net.sf.tweety.arg.deductive.semantics that implement Graph

Modifier and Type	Class	Description
class	ArgumentTree	Instances of this class represent argument trees in the sense of Definition 6.1 in Philippe Besnard and Anthony Hunter.
class	Compilation	Instances of this class are compilations in the sense of Definition 8 in Philippe Besnard and Anthony Hunter.

Uses of Graph in net.sf.tweety.arg.dung.syntax

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

Modifier and Type	Class	Description
class	DungTheory	This class implements an abstract argumentation theory in the sense of Dung.

Fields in net.sf.tweety.arg.dung.syntax with type parameters of type Graph

Modifier and Type	Field	Description
private static java.util.Map<DungTheory,java.util.Collection<Graph<Argument>>>	DungTheory.archivedSubgraphs	For archiving sub graphs

Methods in net.sf.tweety.arg.dung.syntax that return Graph

Modifier and Type	Method	Description
Graph<Argument>	DungTheory.getRestriction(java.util.Collection<Argument> arguments)

Methods in net.sf.tweety.arg.dung.syntax that return types with arguments of type Graph

Modifier and Type	Method	Description
java.util.Collection<Graph<Argument>>	DungTheory.getComponents()	Returns the (connected) components of the theory
java.util.Collection<Graph<Argument>>	DungTheory.getSubgraphs()

Constructors in net.sf.tweety.arg.dung.syntax with parameters of type Graph

Constructor	Description
DungTheory(Graph<Argument> graph)	Creates a new theory from the given graph.

Uses of Graph in net.sf.tweety.arg.prob.syntax

Classes in net.sf.tweety.arg.prob.syntax that implement Graph

Modifier and Type	Class	Description
class	ProbabilisticArgumentationFramework	This class implements the probabilistic argumentation framework approach of [Li, Oren, Norman.

Constructors in net.sf.tweety.arg.prob.syntax with parameters of type Graph

Constructor	Description
ProbabilisticArgumentationFramework(Graph<Argument> graph)	Creates a new PAF from the given graph, all arguments and attacks have probability 1.

Uses of Graph in net.sf.tweety.arg.saf.syntax

Classes in net.sf.tweety.arg.saf.syntax that implement Graph

Modifier and Type	Class	Description
class	StructuredArgumentationFramework	This class represents a structured argumentation framework, i.e.

Uses of Graph in net.sf.tweety.arg.social.syntax

Classes in net.sf.tweety.arg.social.syntax that implement Graph

Modifier and Type	Class	Description
class	SocialAbstractArgumentationFramework	This class implements a social abstract argumentation framework from [Joao Leite, Joao Martins.

Constructors in net.sf.tweety.arg.social.syntax with parameters of type Graph

Constructor	Description
SocialAbstractArgumentationFramework(Graph<Argument> graph)	Creates a new social abstract argumentation framework from the given graph.

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(java.util.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> java.util.Collection<Graph<S>>	DefaultGraph.getComponents(Graph<S> g)	Finds all components of a graph and returns them as a graph.
java.util.Collection<Graph<T>>	DefaultGraph.getSubgraphs()
static <S extends Node> java.util.Collection<Graph<S>>	DefaultGraph.getSubgraphs(Graph<S> g)	Returns the set of sub graphs of the given graph.
java.util.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, java.util.Map<Node,java.lang.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> 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> 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.

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

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

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

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

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