Modifier and Type | Class and Description |
---|---|
class |
ExecutableDungTheory
This class packs a Dung theory into an executable object.
|
Modifier and Type | Class and Description |
---|---|
class |
PerceivableStructuredArgumentationFramework
This class packs a structured argumentation framework into a
perceivable object.
|
Modifier and Type | Class and 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. |
Modifier and Type | Class and Description |
---|---|
class |
DungTheory
This class implements an abstract argumentation theory in the sense of Dung.
|
Modifier and Type | Field and Description |
---|---|
private static java.util.Map<DungTheory,java.util.Collection<Graph<Argument>>> |
DungTheory.archivedSubgraphs
For archiving sub graphs
|
Modifier and Type | Method and Description |
---|---|
Graph<Argument> |
DungTheory.getRestriction(java.util.Collection<Argument> arguments) |
Modifier and Type | Method and Description |
---|---|
java.util.Collection<Graph<Argument>> |
DungTheory.getSubgraphs() |
Constructor and Description |
---|
DungTheory(Graph<Argument> graph)
Creates a new theory from the given graph.
|
Modifier and Type | Method and Description |
---|---|
static java.lang.Double |
AnalysisTest.hitsRankInverted(Graph<? extends Node> g,
Node n,
double precision,
boolean getAuth) |
static java.lang.Double |
AnalysisTest.pageRankInverted(Graph<? extends Node> g,
Node n,
double dampingFactor,
double precision)
Inverted PageRank
|
Modifier and Type | Class and Description |
---|---|
class |
ProbabilisticArgumentationFramework
This class implements the probabilistic argumentation framework approach
of [Li, Oren, Norman.
|
Constructor and Description |
---|
ProbabilisticArgumentationFramework(Graph<Argument> graph)
Creates a new PAF from the given graph, all arguments
and attacks have probability 1.
|
Modifier and Type | Class and Description |
---|---|
class |
StructuredArgumentationFramework
This class represents a structured argumentation framework, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
SocialAbstractArgumentationFramework
This class implements a social abstract argumentation framework from
[Joao Leite, Joao Martins.
|
Constructor and Description |
---|
SocialAbstractArgumentationFramework(Graph<Argument> graph)
Creates a new social abstract argumentation framework from the given graph.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultGraph<T extends Node>
Instance of this class represent graphs with
nodes of type T
|
Modifier and Type | Method and 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.
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<Graph<T>> |
DefaultGraph.getSubgraphs() |
java.util.Collection<Graph<T>> |
Graph.getSubgraphs()
Returns the set of sub graphs of this graph.
|
static <S extends Node> |
DefaultGraph.getSubgraphs(Graph<S> g)
Returns the set of sub graphs of the given graph.
|
Modifier and Type | Method and Description |
---|---|
static <S extends Node> |
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> |
DefaultGraph.getStronglyConnectedComponents(Graph<S> g)
Returns the strongly connected components of the given graph.
|
private static <S extends Node> |
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> |
DefaultGraph.getSubgraphs(Graph<S> g)
Returns the set of sub graphs of the given graph.
|
Modifier and Type | Field and 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.
|
Modifier and Type | Method and Description |
---|---|
static ComplexNumber[] |
GraphUtil.eigenvalues(Graph<? extends Node> g)
Computes the (real parts of the) Eigenvalues of the given graph.
|
static <T extends Node> |
GraphUtil.enumerateChordlessCircuits(Graph<T> g)
Enumerates all chordless circuits of the given graph, i.e.
|
static <T extends Node> |
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 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> |
GraphUtil.undirecteddiameter(Graph<T> g)
Returns the (undirected) diameter of the graph, i.e.
|