Class/Object

EulerTour

Related Docs: object EulerTour | package graph

Permalink

class EulerTour[T] extends AnyRef

A class that represents an Euler Tour of a directed graph from a given root. This requires O(n) preprocessing time to generate the initial Euler Tour.

Source: EulerTour.scala

Linear Supertypes

Type Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

EulerTour
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Instance Constructors

new EulerTour(r: Map[T, Int], e: Seq[T], h: Seq[Int])

Create a new EulerTour from the specified data
Create a new EulerTour from the specified data
r
A map of a node to its first index
e
A representation of the EulerTour as a Seq[T]
h
The depths of the Euler Tour represented as a Seq[Int]

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def rmq(x: T, y: T): T

Range Minimum Query of the Euler Tour.
Range Minimum Query of the Euler Tour.
Use this for typical queries.
x
The first query bound
y
The second query bound
returns
The minimum between the first and second query

Note
The order of x and y does not matter
,
This currently maps to rmqBV, but may choose to map to either rmqBV or rmqNaive
def rmqBV(x: T, y: T): T

Range Minimum Query using the Berkman--Vishkin algorithm with the simplifications of Bender--Farach-Colton.
Range Minimum Query using the Berkman--Vishkin algorithm with the simplifications of Bender--Farach-Colton.
x
The first query bound
y
The second query bound
returns
The minimum between the first and second query
Note
Performance:
preprocessing: O(n)
query: O(1)
,
The order of x and y does not matter
def rmqNaive(x: T, y: T): T

Range Minimum Query of an Euler Tour using a naive algorithm.
Range Minimum Query of an Euler Tour using a naive algorithm.
x
The first query bound
y
The second query bound
returns
The minimum between the first and second query
Note
Performance:
preprocessing: O(1)
query: O(n)
,
The order of x and y does not matter
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Inherited from AnyRef

Inherited from Any

Ungrouped