Interface PlanarityTestingAlgorithm.Embedding<V,E>

Type Parameters:
V - the graph vertex type
E - the graph edge type
All Known Implementing Classes:
PlanarityTestingAlgorithm.EmbeddingImpl
Enclosing interface:
PlanarityTestingAlgorithm<V,E>
public static interface PlanarityTestingAlgorithm.Embedding<V,E>
A combinatorial embedding of the graph. It is represented as the edges ordered clockwise around the vertices. The edge order around the vertices is sufficient to embed the graph on a plane, i.e. assign coordinates to its vertices and draw its edges such that none of the cross.

  • Method Summary

    Modifier and Type
    Method
    Description
    List<E>
    getEdgesAround(V vertex)
    Returns the clockwise order of edges incident to the vertex
    Graph<V,E>
    getGraph()
    Returns the underlying graph

  • Method Details

    • getEdgesAround

      List<E> getEdgesAround(V vertex)
      Returns the clockwise order of edges incident to the vertex
      Parameters:
      vertex - the vertex whose incident edges are returned
      Returns:
      the clockwise order of edges incident to the vertex

    • getGraph

      Graph<V,E> getGraph()
      Returns the underlying graph
      Returns:
      the underlying graph