object MuGraph
The MuGraph
companion object provides builder methods and example query
multi-digraphs.
- Alphabetic
- By Inheritance
- MuGraph
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
def
apply(tree: Tree[Double], name: String = "t", inverse: Boolean = false): MuGraph[Double]
Build a
MuGraph
from aTree
.Build a
MuGraph
from aTree
.- tree
the base
Tree
for building theMuGraph
- name
the name for the new multi-digraph
- inverse
whether to add parent references
-
def
apply[TLabel](mgr: MGraph[TLabel], name: String)(implicit arg0: ClassTag[TLabel]): MuGraph[TLabel]
Build a
MuGraph
from aMGraph
.Build a
MuGraph
from aMGraph
.- mgr
the base
MGraph
for building theMuGraph
- name
the name for the new multi-digraph
-
def
apply[TLabel](gr: Graph[TLabel], eLab: Map[Pair, Set[TLabel]], name: String)(implicit arg0: ClassTag[TLabel]): MuGraph[TLabel]
Build a
MuGraph
from aGraph
.Build a
MuGraph
from aGraph
.- gr
the base
Graph
for building theMuGraph
- eLab
the edge labels
- name
the name for the new multi-digraph
-
def
apply[TLabel](label: Array[TLabel], le: Map[Pair, Set[TLabel]], id: Array[Int], inverse: Boolean, schema: Array[String])(implicit arg0: ClassTag[TLabel]): MuGraph[TLabel]
Build a 'MuGraph' from the given vertex labels and edge mappings.
Build a 'MuGraph' from the given vertex labels and edge mappings.
- label
the vertex labels
- le
the map of edges, vertex pair -> set of edge labels
- id
the vertex id's
- inverse
whether to store inverse adjacency sets (parents)
- schema
the type of the vertices
-
def
ν[TLabel](labelMap: Map[Pair, TLabel])(implicit arg0: ClassTag[TLabel]): Map[Pair, Set[TLabel]]
Collect the labels in the map into sets.
Collect the labels in the map into sets.
- labelMap
the initial label map
-
def
ν[TLabel](label: TLabel*)(implicit arg0: ClassTag[TLabel]): Set[TLabel]
Collect the label(s) into a set.
Collect the label(s) into a set.
- label
the given label(s)