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
- Alphabetic
- By Inheritance
- EulerTour
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
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[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
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
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @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
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @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
This currently maps to
,rmqBV
, but may choose to map to eitherrmqBV
orrmqNaive
The order of x and y does not matter
-
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
The order of x and y does not matter
,Performance:
- preprocessing:
O(n)
- query:
O(1)
- preprocessing:
-
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
The order of x and y does not matter
,Performance:
- preprocessing:
O(1)
- query:
O(n)
- preprocessing:
-
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( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
This is the documentation for Firrtl.