root
API
Generated with
root/org.encalmo.data

org.encalmo.data

package org.encalmo.data

Members list

Type members

Classlikes

trait GenericGraph[N] extends Graph[N]

Simple graph defined by abstract nodes collection and adjacent nodes function. Requires implementation of only two methods: nodes and adjacent.

Simple graph defined by abstract nodes collection and adjacent nodes function. Requires implementation of only two methods: nodes and adjacent.

Attributes

Supertypes
trait Graph[N]
class Object
trait Matchable
class Any
Known subtypes
class GenericGraphImpl[N]
class WeightedGraphImpl[N, V]
class MapGraph[N]
class IntMapGraph
class MutableMapGraph[N]
Show all
Self type
sealed trait GenericHeap[N] extends Heap[N]

The (binary) heap data structure is an buffer-wrapping object that can be viewed as a nearly complete binary tree

The (binary) heap data structure is an buffer-wrapping object that can be viewed as a nearly complete binary tree

Attributes

Supertypes
trait Heap[N]
class Object
trait Matchable
class Any
Known subtypes
class MaxHeap[N]
class MinHeap[N]
Self type
final class GenericReverseGraph[N](origin: Graph[N]) extends GenericGraph[N]

Reverse graph of the given graph.

Reverse graph of the given graph.

Attributes

Supertypes
trait GenericGraph[N]
trait Graph[N]
class Object
trait Matchable
class Any
trait Graph[N]

Base asbtraction of the graph-like data structures.

Base asbtraction of the graph-like data structures.

Type parameters

N

The type of the nodes in the graph.

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait GenericGraph[N]
class GenericGraphImpl[N]
class WeightedGraphImpl[N, V]
class MapGraph[N]
class IntMapGraph
class MutableMapGraph[N]
Show all
object Graph

Graph operations.

Graph operations.

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
Graph.type
sealed trait Heap[N]

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait GenericHeap[N]
class MaxHeap[N]
class MinHeap[N]
final class IntMapGraph(nodeMap: Map[Int, Traversable[Int]] = ...) extends MapGraph[Int]

Graph implemented as a map of nodes to adjacent nodes, where the nodes are integers.

Graph implemented as a map of nodes to adjacent nodes, where the nodes are integers.

Attributes

Supertypes
class MapGraph[Int]
trait GenericGraph[Int]
trait Graph[Int]
class Object
trait Matchable
class Any
Show all
trait IntTraversable extends Traversable[Int]

Abstraction of the collection of integers accessible mainly using the foreach method.

Abstraction of the collection of integers accessible mainly using the foreach method.

Attributes

Supertypes
trait Traversable[Int]
class Object
trait Matchable
class Any
Known subtypes
class MapGraph[N](nodeMap: Map[N, Traversable[N]] = ...) extends GenericGraph[N]

Graph implemented as a map of nodes to adjacent nodes.

Graph implemented as a map of nodes to adjacent nodes.

Attributes

Supertypes
trait GenericGraph[N]
trait Graph[N]
class Object
trait Matchable
class Any
Known subtypes
class IntMapGraph
class MaxHeap[N](initialSize: Int = ...)(using evidence$1: Ordering[N]) extends GenericHeap[N]

Attributes

Supertypes
trait GenericHeap[N]
trait Heap[N]
class Object
trait Matchable
class Any
object Mermaid

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type
Mermaid.type
final class MinHeap[N](initialSize: Int = ...)(using evidence$1: Ordering[N]) extends GenericHeap[N]

Attributes

Supertypes
trait GenericHeap[N]
trait Heap[N]
class Object
trait Matchable
class Any
trait Mutable[N] extends Growable[(N, N)], Shrinkable[(N, N)]

Mutable graph add-on

Mutable graph add-on

Attributes

Supertypes
trait Shrinkable[(N, N)]
trait Growable[(N, N)]
trait Clearable
class Object
trait Matchable
class Any
Show all
Known subtypes
class MutableMapGraph[N]
object MutableMapGraph

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
class MutableMapGraph[N](val nodeMap: Map[N, ArrayBuffer[N]] = ...) extends GenericGraph[N], Mutable[N]

Mutable graph implemented as a mutable map of nodes to adjacent nodes.

Mutable graph implemented as a mutable map of nodes to adjacent nodes.

Attributes

Companion
object
Supertypes
trait Mutable[N]
trait Shrinkable[(N, N)]
trait Growable[(N, N)]
trait Clearable
trait GenericGraph[N]
trait Graph[N]
class Object
trait Matchable
class Any
Show all
Known subtypes
object QuickSort

Sorts mutable sequences in-place

Sorts mutable sequences in-place

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type
QuickSort.type
trait Traversable[N]

Abstraction of the collection of items accessible mainly using the {foreach} method.

Abstraction of the collection of items accessible mainly using the {foreach} method.

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class TraversableImpl[N]
Show all
object Traversable

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
trait Weighted[N, V]

Weighted graph add-on

Weighted graph add-on

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class WeightedGraphImpl[N, V]
Generated with