The Graph companion object provides builder methods and example query digraphs.
Attributes
Members list
Type members
Inherited and Abstract types
The names of the product elements
The names of the product elements
Attributes
- Inherited from:
- Mirror
The name of the type
The name of the type
Attributes
- Inherited from:
- Mirror
Value members
Concrete methods
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
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