Class AbstractRankedGraph<B extends Bigraph<?>,N,E>

java.lang.Object
org.bigraphs.framework.core.AbstractRankedGraph<B,N,E>
Type Parameters:
B - type of the bigraph
N - type of the ranked graph's node
E - type of the ranked graph's edge
Direct Known Subclasses:
PureBigraphRankedGraphEncoding

public abstract class AbstractRankedGraph<B extends Bigraph<?>,N,E> extends Object
Abstract base class for a ranked graph representation for different classes of bigraphs. The node and edge types for the ranked graph can be specified.

The concrete implementations can be found in the bigraph-converter module.

Author:
Dominik Grzelak
  • Field Details

    • bigraph

      protected B extends Bigraph<?> bigraph
    • graph

      protected org.jgrapht.Graph<N,E> graph
    • roots

      protected Map<String,N> roots
    • variables

      protected Map<String,N> variables
    • variableMap

      protected Map<String,List<N>> variableMap
    • rootMap

      protected Map<String,List<N>> rootMap
    • encodingStarted

      protected boolean encodingStarted
    • encodingFinished

      protected boolean encodingFinished
  • Constructor Details

    • AbstractRankedGraph

      public AbstractRankedGraph(B bigraph)
  • Method Details

    • init

      protected abstract void init()
    • encode

      public abstract void encode()
    • getDirectedGraph

      protected <NT extends N, ET extends E> org.jgrapht.Graph<NT,ET> getDirectedGraph()
    • getGraph

      public org.jgrapht.Graph<N,E> getGraph()
    • isEncodingStarted

      public boolean isEncodingStarted()
    • isEncodingFinished

      public boolean isEncodingFinished()