Packages

object MuGraph

The MuGraph companion object provides builder methods and example query multi-digraphs.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MuGraph
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply(tree: Tree[Double], name: String = "t", inverse: Boolean = false): MuGraph[Double]

    Build a MuGraph from a Tree.

    Build a MuGraph from a Tree.

    tree

    the base Tree for building the MuGraph

    name

    the name for the new multi-digraph

    inverse

    whether to add parent references

  5. def apply[TLabel](mgr: MGraph[TLabel], name: String)(implicit arg0: ClassTag[TLabel]): MuGraph[TLabel]

    Build a MuGraph from a MGraph.

    Build a MuGraph from a MGraph.

    mgr

    the base MGraph for building the MuGraph

    name

    the name for the new multi-digraph

  6. def apply[TLabel](gr: Graph[TLabel], eLab: Map[Pair, Set[TLabel]], name: String)(implicit arg0: ClassTag[TLabel]): MuGraph[TLabel]

    Build a MuGraph from a Graph.

    Build a MuGraph from a Graph.

    gr

    the base Graph for building the MuGraph

    eLab

    the edge labels

    name

    the name for the new multi-digraph

  7. 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

  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  20. def toString(): String
    Definition Classes
    AnyRef → Any
  21. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  24. 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

  25. 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)

Inherited from AnyRef

Inherited from Any

Ungrouped