Package kieker.analysis.generic.graph

Interface IGraph<N extends INode,​E extends IEdge>

Type Parameters:
N - node type
E - edge type
All Known Implementing Classes:
GraphImpl
public interface IGraph<N extends INode,​E extends IEdge>
The Kieker IGraph is based on the google Graph library. It addes primarily the notion of a name for the graph and subgraphs inside nodes.
Since:
2.0.0
Author:
Reiner Jung

  • Method Summary

    Modifier and Type Method Description
    java.util.Optional<E> findEdge​(java.lang.String id)
    Find an edge by its id.
    java.util.Optional<N> findNode​(java.lang.String id)
    Find a node by its id.
    com.google.common.graph.MutableNetwork<N,​E> getGraph()
    Get the underlying google graph (network).
    java.lang.String getLabel()  
    void setLabel​(java.lang.String label)
    Set the graph label.

  • Method Details

    • getGraph

      com.google.common.graph.MutableNetwork<N,​E> getGraph()
      Get the underlying google graph (network).
      Returns:
      return the graph

    • getLabel

      java.lang.String getLabel()
      Returns:
      returns the graph label

    • setLabel

      void setLabel​(java.lang.String label)
      Set the graph label.
      Parameters:
      label - label of the graph

    • findNode

      java.util.Optional<N> findNode​(java.lang.String id)
      Find a node by its id.
      Parameters:
      id - id of the node
      Returns:
      returns an optional which may contain the node or nothing when no node with the given id exists

    • findEdge

      java.util.Optional<E> findEdge​(java.lang.String id)
      Find an edge by its id.
      Parameters:
      id - id of the edge
      Returns:
      returns an optional which may contain the edge or nothing when no edge with the given id exists