TriangleCount

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(): (Double, Double)

   

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def computeWedgesInEdgeReservoir(edgeReservoir: IntTuplesArray): Int

   

8. val edgeReservoir: IntTuplesArray

   

   We store an undirected edge as a list of ints List(a, b), where a < b.

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

   

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

14. var isClosed: BitSet

    

    isClosed(i) iff wedgeReservoid(i) is a closed wedge.

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

18. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

19. val rng: Random

    

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

    

    Definition Classes

    AnyRef

21. def toString(): String

    

    Definition Classes

    AnyRef → Any

22. var totalWedges: Long

    

23. def update(iteration: Int, fromNode: Int, toNode: Int): (Double, Long)

    

    Updates fields with edge (fromNode, toNode).

    Updates fields with edge (fromNode, toNode). Assumes that fromNode < toNode.

    iteration

    Iteration number

    fromNode

    Id of node with lower id

    toNode

    Id of node with higer id

    returns

    Pair: fraction of closed wedges in wedgeReservoir, total distinct wedges in edge reservoir.

24. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. val wedgeReservoir: IntTuplesArray

    

    A wedge is a list of ints List(a, b, c), where a < c and (a, b) and (b, c) are undirected edges in the graph.