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
- Protected
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
- def apply(tree: Tree[Double], name: String = "t", inverse: Boolean = false): MuGraph[Double]
Build a
MuGraphfrom aTree.Build a
MuGraphfrom aTree.- tree
the base
Treefor 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
MuGraphfrom aMGraph.Build a
MuGraphfrom aMGraph.- mgr
the base
MGraphfor 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
MuGraphfrom aGraph.Build a
MuGraphfrom aGraph.- gr
the base
Graphfor 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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- 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()
- 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(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- 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)
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated