Uses of Interface
org.tweetyproject.graphs.Graph

Packages that use Graph

Package	Description
org.tweetyproject.agents.dialogues
org.tweetyproject.agents.dialogues.structured
org.tweetyproject.arg.bipolar.syntax
org.tweetyproject.arg.deductive.semantics
org.tweetyproject.arg.dung.syntax
org.tweetyproject.arg.prob.syntax
org.tweetyproject.arg.saf.syntax
org.tweetyproject.arg.social.syntax
org.tweetyproject.graphs
org.tweetyproject.graphs.util
org.tweetyproject.logics.bpm.syntax
org.tweetyproject.logics.petri.syntax
org.tweetyproject.logics.petri.syntax.reachability_graph

Uses of Graph in org.tweetyproject.agents.dialogues

Classes in org.tweetyproject.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 org.tweetyproject.agents.dialogues.structured

Classes in org.tweetyproject.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 org.tweetyproject.arg.bipolar.syntax

Classes in org.tweetyproject.arg.bipolar.syntax that implement Graph

Modifier and Type	Class	Description
class	AbstractBipolarFramework	This class implements a bipolar abstract argumentation framework with attack and support relations.
class	DeductiveArgumentationFramework	This class implements a bipolar abstract argumentation theory with support in a deductive sense.
class	EvidentialArgumentationFramework	This class implements a bipolar abstract argumentation theory with support in an evidential sense.
class	NecessityArgumentationFramework	This class implements a bipolar abstract argumentation framework with necessities.

Methods in org.tweetyproject.arg.bipolar.syntax that return Graph

Modifier and Type	Method	Description
Graph<BArgument>	AbstractBipolarFramework.getComplementGraph(int i)
Graph<BArgument>	AbstractBipolarFramework.getRestriction(Collection<BArgument> collection)

Methods in org.tweetyproject.arg.bipolar.syntax that return types with arguments of type Graph

Modifier and Type	Method	Description
Collection<Graph<BArgument>>	AbstractBipolarFramework.getSubgraphs()

Uses of Graph in org.tweetyproject.arg.deductive.semantics

Classes in org.tweetyproject.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 org.tweetyproject.arg.dung.syntax

Classes in org.tweetyproject.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.
class	WeightedDungTheory	Minimalistic Implementation of a weighted argumentation theory used for learning argumentation theories from labelings

Methods in org.tweetyproject.arg.dung.syntax that return Graph

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

Methods in org.tweetyproject.arg.dung.syntax that return types with arguments of type Graph

Modifier and Type	Method	Description
Collection<Graph<Argument>>	DungTheory.getComponents()
Collection<Graph<Argument>>	DungTheory.getInducedSubgraphs()
Collection<Graph<Argument>>	DungTheory.getSubgraphs()

Constructors in org.tweetyproject.arg.dung.syntax with parameters of type Graph

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

Uses of Graph in org.tweetyproject.arg.prob.syntax

Classes in org.tweetyproject.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 org.tweetyproject.arg.prob.syntax with parameters of type Graph

Modifier	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 org.tweetyproject.arg.saf.syntax

Classes in org.tweetyproject.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 org.tweetyproject.arg.social.syntax

Classes in org.tweetyproject.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 org.tweetyproject.arg.social.syntax with parameters of type Graph

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

Uses of Graph in org.tweetyproject.graphs

Classes in org.tweetyproject.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
class	HyperGraph<T extends Node>	This class implements a simple directed hypergraph
class	SimpleGraph<T extends Node>	An extended version of the DefaultGraph which supports removing of nodes as well as some utility functions for d-separation

Methods in org.tweetyproject.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.

Methods in org.tweetyproject.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.
static <S extends Node> Collection<Graph<S>>	DefaultGraph.getInducedSubgraphs(Graph<S> g)	Finds all induced subgraphs.
Collection<Graph<T>>	DefaultGraph.getSubgraphs()
static <S extends Node> Collection<Graph<S>>	DefaultGraph.getSubgraphs(GeneralGraph<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.
Collection<Graph<T>>	HyperGraph.getSubgraphs()
Collection<Graph<T>>	HyperGraph.getSubgraphs(HyperGraph<T> g)	Returns the set of sub graphs of the given graph.

Methods in org.tweetyproject.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.
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<Graph<S>>	DefaultGraph.getInducedSubgraphs(Graph<S> g)	Finds all induced subgraphs.
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> boolean	DefaultGraph.isBipartite(Graph<S> g)	checks whether the given graph is bipartite or not the algorithm starts at a random node and colors adjacent nodes in alternating colors if two adjacent nodes have the same color, the graph is no bipartite NOTE: This method only works if the given graph is connected

Constructors in org.tweetyproject.graphs with parameters of type Graph

Modifier	Constructor	Description
	SimpleGraph(Graph<T> graph)	create a copy of the given graph

Uses of Graph in org.tweetyproject.graphs.util

Methods in org.tweetyproject.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 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.

Constructors in org.tweetyproject.graphs.util with parameters of type Graph

Modifier	Constructor	Description
	GraphPlotter(Plotter plotter, Graph<T> graph)	Create a new instance

Uses of Graph in org.tweetyproject.logics.bpm.syntax

Classes in org.tweetyproject.logics.bpm.syntax that implement Graph

Modifier and Type	Class	Description
class	BpmnModel	A class to represent a BPMN Model

Methods in org.tweetyproject.logics.bpm.syntax that return Graph

Modifier and Type	Method	Description
Graph<BpmnNode>	BpmnModel.getComplementGraph(int selfloops)
Graph<BpmnNode>	BpmnModel.getRestriction(Collection<BpmnNode> nodes)

Methods in org.tweetyproject.logics.bpm.syntax that return types with arguments of type Graph

Modifier and Type	Method	Description
Collection<Graph<BpmnNode>>	BpmnModel.getSubgraphs()

Uses of Graph in org.tweetyproject.logics.petri.syntax

Classes in org.tweetyproject.logics.petri.syntax that implement Graph

Modifier and Type	Class	Description
class	PetriNet	A class to represent a Petri net

Methods in org.tweetyproject.logics.petri.syntax that return Graph

Modifier and Type	Method	Description
Graph<PetriNetNode>	PetriNet.getComplementGraph(int selfloops)
Graph<PetriNetNode>	PetriNet.getRestriction(Collection<PetriNetNode> nodes)

Methods in org.tweetyproject.logics.petri.syntax that return types with arguments of type Graph

Modifier and Type	Method	Description
Collection<Graph<PetriNetNode>>	PetriNet.getSubgraphs()

Uses of Graph in org.tweetyproject.logics.petri.syntax.reachability_graph

Classes in org.tweetyproject.logics.petri.syntax.reachability_graph that implement Graph

Modifier and Type	Class	Description
class	ReachabilityGraph	A class to describe the graph of reachability between possible markings of a Petri net

Methods in org.tweetyproject.logics.petri.syntax.reachability_graph that return Graph

Modifier and Type	Method	Description
Graph<Marking>	ReachabilityGraph.getComplementGraph(int selfloops)
Graph<Marking>	ReachabilityGraph.getRestriction(Collection<Marking> nodes)

Methods in org.tweetyproject.logics.petri.syntax.reachability_graph that return types with arguments of type Graph

Modifier and Type	Method	Description
Collection<Graph<Marking>>	ReachabilityGraph.getSubgraphs()