scalation
API
Generated with
scalation/scalation/scalation.database/scalation.database.graph_pm/Graph

Graph

scalation.database.graph_pm.Graph
See theGraph companion class
object Graph

The Graph companion object provides builder methods and example query digraphs.

Attributes

Companion
class
Graph
Supertypes
trait Product
trait Mirror
class Object
trait Matchable
class Any
Self type
Graph.type

Members list

Inherited
  • Not inherited
  • Mirror

Type members

Inherited and Abstract types

type MirroredElemLabels <: Tuple

The names of the product elements

The names of the product elements

Attributes

Inherited from:
Mirror
type MirroredLabel <: String

The name of the type

The name of the type

Attributes

Inherited from:
Mirror

Value members

Concrete methods

def apply(label: Array[ValueType], elabel: Map[(Int, Int), ValueType], inverse: Boolean, name: String, schema: Array[String]): Graph

Build a Graph from the given vertex labels and edge mappings.

Build a Graph from the given vertex labels and edge mappings.

Value parameters

elabel

the map of edges, vertex pair -> edge label

inverse

whether to store inverse adjacency sets (parents)

label

the vertex labels

name

the name of the graph

schema

the type of the vertices

Attributes

def fromMatrix(adj: MatrixD, ordered: Boolean, inverse: Boolean, name: String, schema: Array[String]): Graph

Build a Graph from an adjacency matrix (assumes no self-loops).

Build a Graph from an adjacency matrix (assumes no self-loops).

Value parameters

adj

the adjacency matrix representation for the graph

inverse

whether to store inverse adjacency sets (parents)

name

the name of the graph

ordered

implies edges i -> j are ordered i < j

schema

the type of the vertices

Attributes

Generated with