sealed trait EdgePath extends AnyRef

Self Type
EdgePath
Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgePath
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract val initial: Vertex
  2. abstract val terminal: Vertex

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(e: Edge): EdgePath

    More natural notation for appending an edge

  4. def ++(path: EdgePath): EdgePath

    Concatenation for EdgePaths

  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def AIN(path: EdgePath, nonposQuad: NonPosQuad): Int

    Calculates the algebraic intersection number of the EdgePath and a given path

  7. def GIN(path: EdgePath, nonposQuad: NonPosQuad): Int

    Calculates the geometric intersection number of the EdgePath and a given path

  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  10. def cyclicalTake(i: Int, j: Int): EdgePath

    Given indexes i and j gives the subpath between i-th and j-th vertex.

    Given indexes i and j gives the subpath between i-th and j-th vertex. Because it works on loops j can be less than i.

  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  13. def extractCrossings(loop: EdgePath, nonposQuad: NonPosQuad, sign: Int): Vector[((Int, Int), (Int, Int))]

    Extracts the start and end indices of the crossings of the given sign between the EdgePath (if it is a loop, error otherwise) and a given loop

  14. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  15. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. def inTwoComplex(twoComplex: TwoComplex): Boolean

    Checks whether the EdgePath is in a given Two Complex

  18. def intersectionsWith(otherPath: EdgePath, twoComplex: TwoComplex): Set[Intersection]

    Given another loop gives intersection along with signs.

  19. def isFreelyHomotopicTo(loop: EdgePath, nonposQuad: NonPosQuad): Boolean
  20. def isHomotopicTo(path: EdgePath, nonposQuad: NonPosQuad): Boolean

    Checks whether two paths are homotopic fixing endpoints

  21. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  22. lazy val isLoop: Boolean
  23. def loopToGeodesic(nonposQuad: NonPosQuad): EdgePath

    Reduces a loop to a geodesic

  24. def mod(m: Int, n: Int): Int
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. def negativeCrossings(loop: EdgePath, nonposQuad: NonPosQuad): Vector[((Int, Int), (Int, Int))]

    Extracts the start and end indices of all negative crossings between the canonical forms of the EdgePath (if it is a loop, error otherwise) and a given loop

  27. def nonCrossings(loop: EdgePath, nonposQuad: NonPosQuad): Vector[((Int, Int), (Int, Int))]

    Extracts the start and end indices of all non-crossings between the canonical forms EdgePath (if it is a loop, error otherwise) and a given loop

  28. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  29. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  30. def positiveCrossings(loop: EdgePath, nonposQuad: NonPosQuad): Vector[((Int, Int), (Int, Int))]

    Extracts the start and end indices of all positive crossings between the canonical forms of the EdgePath (if it is a loop, error otherwise) and a given loop

  31. def reverse: EdgePath
  32. def selfAIN(path: EdgePath, nonposQuad: NonPosQuad): Int

    Calculates the geometric self-intersection number of a curve

  33. def selfGIN(nonposQuad: NonPosQuad): Int

    Calculates the geometric self-intersection number of a curve

  34. def selfIntersection(nonposQuad: NonPosQuad): Set[Intersection]

    Gives self intersections with signs.

  35. def shiftBasePoint: EdgePath

    In case the EdgePath is a loop, shifts the basePoint to the terminal of the first edge.

  36. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  37. def toString(): String
    Definition Classes
    AnyRef → Any
  38. def verticesCovered: Set[Vertex]

    Gives the set of vertices visited by the path.

  39. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  40. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  41. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped