TGraphImpl

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. def addNode(node: A): TGraphImpl[A]

   Definition Classes

   TGraphImpl → TGraph

7. def addTriple(triple: (A, A, A)): TGraphImpl[A]

   Definition Classes

   TGraphImpl → TGraph

8. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

9. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. def decomp(node: A): Option[(TContext[A], TGraph[A])]

    Definition Classes

    TGraphImpl → TGraph

11. def decompAny: Option[(TContext[A], TGraph[A])]

    Definition Classes

    TGraph

12. def deleteNode(node: A): TGraphImpl[A]

    Definition Classes

    TGraphImpl → TGraph

13. def empty: TGraphImpl[A]

    Definition Classes

    TGraphImpl → TGraph

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

    Definition Classes

    AnyRef

15. def extend(ctx: TContext[A]): TGraphImpl[A]

    Definition Classes

    TGraphImpl → TGraph

16. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

17. final def foldTGraph[B](accum: B)(f: (B, TContext[A]) ⇒ B): B

    Definition Classes

    TGraph

    Annotations

    @tailrec()

18. final def foldTGraphOrd[B](accum: B)(f: (B, TContext[A]) ⇒ B)(implicit ord: Ordering[A]): B

    Definition Classes

    TGraph

    Annotations

    @tailrec()

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

    Definition Classes

    AnyRef → Any

20. val graph: Graph[A, Triple]

21. def isEmpty: Boolean

    Definition Classes

    TGraphImpl → TGraph

22. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

23. def map[B](f: (A) ⇒ B)(implicit arg0: Manifest[B]): TGraph[B]

    Definition Classes

    TGraphImpl → TGraph

24. def mkGraph(triples: Set[(A, A, A)]): TGraph[A]

    Add a list of triples to a graph

    Add a list of triples to a graph

    triples

    to add

    Definition Classes

    TGraph

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

    Definition Classes

    AnyRef

26. def nodes: Set[A]

    List of nodes

    List of nodes

    Definition Classes

    TGraphImpl → TGraph

27. final def notify(): Unit

    Definition Classes

    AnyRef

28. final def notifyAll(): Unit

    Definition Classes

    AnyRef

29. def pred(node: A): Option[Set[(A, A)]]

    List of predecessors: incoming edges (origin,rel)

    List of predecessors: incoming edges (origin,rel)

    node

    resource

30. def rels(node: A): Option[Set[(A, A)]]

    List of related nodes: (origin,destiny)

    List of related nodes: (origin,destiny)

    node

    resource

31. def remove(node: A): TGraphImpl[A]

32. def succ(node: A): Option[Set[(A, A)]]

    List of successors: outgoing edges (rel,destiny)

    List of successors: outgoing edges (rel,destiny)

    node

    resource

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

    Definition Classes

    AnyRef

34. def triples: Set[(A, A, A)]

    Definition Classes

    TGraph

35. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )