Interface GeneralGraph<T extends Node>

All Superinterfaces:
Iterable<T>
All Known Subinterfaces:
DirHyperGraph<T>, Graph<T>
All Known Implementing Classes:
AbstractBipolarFramework, AbstractEAFTheory, ArgumentTree, BpmnModel, ClaimBasedTheory, Compilation, DeductiveArgumentationFramework, DefaultGraph, DungTheory, EAFTheory, EvidentialArgumentationFramework, ExecutableDungTheory, HyperGraph, IncompleteTheory, InducedTheory, NamedPEAFTheory, NecessityArgumentationFramework, PEAFTheory, PerceivableStructuredArgumentationFramework, PetriNet, ProbabilisticArgumentationFramework, ReachabilityGraph, SerialisationGraph, SetAf, SimpleGraph, SocialAbstractArgumentationFramework, StructuredArgumentationFramework, WeightedDungTheory

public interface GeneralGraph<T extends Node> extends Iterable<T>
Author:
Sebastian Franke
  • Method Details

    • getRestriction

      GeneralGraph<T> getRestriction(Collection<T> nodes)
      Returns copy of this graph consisting only of the given nodes and all corresponding edges.
      Parameters:
      nodes - a set of nodes
      Returns:
      a graph.
    • getNodes

      Collection<T> getNodes()
      Returns the nodes of this graph.
      Returns:
      the nodes of this graph.
    • getEdges

      Collection<? extends GeneralEdge<? extends T>> getEdges()
      Returns the edges of this graph.
      Returns:
      the edges of this graph.