EdgeAux

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

14. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

15. def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CHyperEdgeBound[_, EE]](factory: CHyperEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N, nodes: N*): E[GraphAux.NodeT]

    Creates a new custom inner hyperedge without modifying the node or edge set.

    Creates a new custom inner hyperedge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

16. def nodesToCEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with CEdgeBound[_, EE]](factory: CEdgeCompanion[EE], attrib: Product, node_1: N, node_2: N): E[GraphAux.NodeT]

    Creates a new custom inner edge without modifying the node or edge set.

    Creates a new custom inner edge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

17. def nodesToEdgeCont(factory: EdgeCompanion[E], node_1: N, node_2: N): E[GraphAux.NodeT]

    Creates a new simple inner edge without modifying the node or edge set.

    Creates a new simple inner edge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

18. def nodesToEdgeCont(factory: HyperEdgeCompanion[E], node_1: N, node_2: N, nodes: N*): E[GraphAux.NodeT]

    Creates a new simple inner hyperedge without modifying the node or edge set.

    Creates a new simple inner hyperedge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

19. def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](factory: LEdgeCompanion[EE], label: L, node_1: N, node_2: N): E[GraphAux.NodeT]

    Creates a new labeled inner edge without modifying the node or edge set.

    Creates a new labeled inner edge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

20. def nodesToLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with LHyperEdgeBound[_, EE], L](factory: LHyperEdgeCompanion[EE], label: L, node_1: N, node_2: N, nodes: N*): E[GraphAux.NodeT]

    Creates a new labeled inner hyperedge without modifying the node or edge set.

    Creates a new labeled inner hyperedge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

21. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](factory: WEdgeCompanion[EE], weight: Long, node_1: N, node_2: N): E[GraphAux.NodeT]

    Creates a new weighted inner edge without modifying the node or edge set.

    Creates a new weighted inner edge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

22. def nodesToWEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WHyperEdgeBound[_, EE]](factory: WHyperEdgeCompanion[EE], weight: Long, node_1: N, node_2: N, nodes: N*): E[GraphAux.NodeT]

    Creates a new weighted inner hyperedge without modifying the node or edge set.

    Creates a new weighted inner hyperedge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

23. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](factory: WLEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N): E[GraphAux.NodeT]

    Creates a new weighted and labeled inner edge without modifying the node or edge set.

    Creates a new weighted and labeled inner edge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

24. def nodesToWLEdgeCont[EE[X] <: E[X] with EdgeLikeIn[X] with WLHyperEdgeBound[_, EE], L](factory: WLHyperEdgeCompanion[EE], weight: Long, label: L, node_1: N, node_2: N, nodes: N*): E[GraphAux.NodeT]

    Creates a new weighted and labeled inner hyperedge without modifying the node or edge set.

    Creates a new weighted and labeled inner hyperedge without modifying the node or edge set.

    Attributes

    protected[scalax.collection]

25. final def notify(): Unit

    Definition Classes

    AnyRef

26. final def notifyAll(): Unit

    Definition Classes

    AnyRef

27. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

28. def toString(): String

    Definition Classes

    AnyRef → Any

29. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

30. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

31. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )