Package org.tweetyproject.arg.dung.serialisibility.syntax

Class SerialisationGraph

java.lang.Object

org.tweetyproject.graphs.DefaultGraph<Extension<DungTheory>>

org.tweetyproject.arg.dung.serialisibility.syntax.SerialisationGraph

All Implemented Interfaces:

Iterable<Extension<DungTheory>>, GeneralGraph<Extension<DungTheory>>, Graph<Extension<DungTheory>>

public class SerialisationGraph
extends DefaultGraph<Extension<DungTheory>>

This class represents a graph visualising the different Extension during the generation process of serialisable extensions.

Version:

TweetyProject 1.23

Author:

Julian Sander

See Also:

• Reference: Matthias Thimm. Revisiting initial sets in abstract argumentation. Argument and Computation 13 (2022) 325–360 DOI 10.3233/AAC-210018 Reference: Lars Bengel and Matthias Thimm. Serialisable Semantics for Abstract Argumentation. Computational Models of Argument (2022) DOI: 10.3233/FAIA220143

Field Summary

Fields inherited from interface org.tweetyproject.graphs.Graph

IGNORE_SELFLOOPS, INVERT_SELFLOOPS, REMOVE_SELFLOOPS

Constructor Summary

Constructors

Constructor	Description
SerialisationGraph(Extension<DungTheory> root, Semantics semanticsUsed, Collection<Extension<DungTheory>> extensionsFound)	Creates a graph containing all transition states during the generation process of the serialisable extensions.
SerialisationGraph(Semantics semanticsUsed, Collection<Extension<DungTheory>> extensionsFound)	Creates a graph containing all transition states during the generation process of the serialisable extensions.
SerialisationGraph(SerialisationGraph graph, Extension<DungTheory> root, Semantics semanticsUsed, Collection<Extension<DungTheory>> extensionsFound)	Creates a graph containing all transition states during the generation process of the serialisable extensions.

Method Summary

Modifier and Type	Method	Description
boolean	add(Extension<DungTheory> node)	Adds the given node to this graph.
boolean	addAll(HashSet<Extension<DungTheory>> nodes)	Method to add all specified nodes to the graph
boolean	addAllEdges(HashSet<Edge<Extension<DungTheory>>> edges)	Method to add all specified edges to the graph
boolean	equals(Object obj)
Collection<Extension<DungTheory>>	getExtensions()
Collection<Extension<DungTheory>>	getLeaves()
Extension<DungTheory>	getNode(Extension<DungTheory> searchedNode)	Method to gain access to a node, who is equal to the one specified
Extension<DungTheory>	getRoot()
Semantics	getSemantics()
Collection<SerialisationSequence>	getSerialisationSequences(Extension<DungTheory> node)	Returns all sequences of sets of arguments from the root to the specified node
String	toString()

Methods inherited from class org.tweetyproject.graphs.DefaultGraph

add, add, areAdjacent, contains, containsBackEdge, containsCycle, existsDirectedPath, existsDirectedPath, getAdjacencyMatrix, getChildren, getComplementGraph, getComponents, getCyclesExcludingSelfLoops, getCyclesIncludingSelfLoops, getEdge, getEdges, getInducedSubgraphs, getNeighbors, getNodes, getNumberOfNodes, getParents, getRestriction, getStronglyConnectedComponents, getStronglyConnectedComponents, getSubgraphs, getSubgraphs, hasSelfLoops, isBipartite, isWeightedGraph, iterator

Methods inherited from class java.lang.Object

getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Details

SerialisationGraph

public SerialisationGraph(Extension<DungTheory> root,
 Semantics semanticsUsed,
 Collection<Extension<DungTheory>> extensionsFound)

Creates a graph containing all transition states during the generation process of the serialisable extensions.

Parameters:

root - Extension with whom the processing of the examined framework started

semanticsUsed - Semantics used for the serialisation process.

extensionsFound - Extensions generated by the serialisation process, associated with this graph.

SerialisationGraph

public SerialisationGraph(Semantics semanticsUsed,
 Collection<Extension<DungTheory>> extensionsFound)

Creates a graph containing all transition states during the generation process of the serialisable extensions.

Parameters:

semanticsUsed - Semantics used for the serialisation process.

extensionsFound - Extensions generated by the serialisation process, associated with this graph.

SerialisationGraph

public SerialisationGraph(SerialisationGraph graph,
 Extension<DungTheory> root,
 Semantics semanticsUsed,
 Collection<Extension<DungTheory>> extensionsFound)

Creates a graph containing all transition states during the generation process of the serialisable extensions.

Parameters:

graph - Graph, showing a serialisation process.

root - Extension with whom the processing of the examined framework started

semanticsUsed - Semantics used for the serialisation process.

extensionsFound - Extensions generated by the serialisation process, associated with this graph.

Method Details

add

public boolean add(Extension<DungTheory> node)

Description copied from interface: Graph

Adds the given node to this graph.

Specified by:

add in interface Graph<Extension<DungTheory>>

Overrides:

add in class DefaultGraph<Extension<DungTheory>>

Parameters:

node - some node.

Returns:

"true" iff the edge has been added successfully.

addAll

public boolean addAll(HashSet<Extension<DungTheory>> nodes)

Method to add all specified nodes to the graph

Parameters:

nodes - Nodes to add to the graph

Returns:

TRUE iff nodes have been successfully added to the graph

addAllEdges

public boolean addAllEdges(HashSet<Edge<Extension<DungTheory>>> edges)

Method to add all specified edges to the graph

Parameters:

edges - Edges to add to the graph

Returns:

TRUE iff the edges have been added successfully to the graph

equals

public boolean equals(Object obj)

Overrides:

equals in class Object

getExtensions

public Collection<Extension<DungTheory>> getExtensions()

Returns:

Array of extensions, that have been found during the process shown by this graph.

getLeaves

public Collection<Extension<DungTheory>> getLeaves()

Returns:

All leaf-nodes of this graph.

getNode

public Extension<DungTheory> getNode(Extension<DungTheory> searchedNode)
                              throws IllegalArgumentException

Method to gain access to a node, who is equal to the one specified

Parameters:

searchedNode - Node, to whom the returned node has to be equal

Returns:

Node, which is part of this graph and which is equal to the specified node

Throws:

IllegalArgumentException - Thrown if there is no node in this graph equal to the one specified

getRoot

public Extension<DungTheory> getRoot()

Returns:

Extension with whom the processing of the examined framework started

getSemantics

public Semantics getSemantics()

Returns:

Semantics used for the serialisation process

getSerialisationSequences

public Collection<SerialisationSequence> getSerialisationSequences(Extension<DungTheory> node)

Returns all sequences of sets of arguments from the root to the specified node

Parameters:

node - Destination of the path

Returns:

Sequences of sets, used to construct the extension, represented by the node

toString

public String toString()

Specified by:

toString in interface Graph<Extension<DungTheory>>

Overrides:

toString in class DefaultGraph<Extension<DungTheory>>