TestGraphs

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. val g1: TestGraph

12. val g2_mutual: TestGraph

13. val g2_nonmutual: TestGraph

14. def g3: ArrayBasedDirectedGraph

15. def g5: ArrayBasedDirectedGraph

16. def g6: ArrayBasedDirectedGraph

17. def g6_onlyin: ArrayBasedDirectedGraph

18. def g6_onlyout: ArrayBasedDirectedGraph

19. def g7_onlyin: ArrayBasedDirectedGraph

20. def g7_onlyout: ArrayBasedDirectedGraph

21. def generateCompleteGraph(numNodes: Int): TestGraph

22. def generateRandomGraph(numNodes: Int, probEdge: Double, graphDir: StoredGraphDir = StoredGraphDir.BothInOut): ArrayBasedDirectedGraph

    numNodes

    number of nodes in the graph

    probEdge

    probability of existence of an edge

    graphDir

    store both directions or only one direction

    returns

    a random Erdos-Renyi Directed graph

23. def generateRandomUndirectedGraph(numNodes: Int, probEdge: Double, graphDir: StoredGraphDir = StoredGraphDir.BothInOut): ArrayBasedDirectedGraph

    numNodes

    number of nodes in the undirected graph

    probEdge

    probability of existence of an edge, constant for each of (numNodes choose 2) edges

    graphDir

    store both directions or only one direction

    returns

    a random Erdos-Renyi undirected graph (a graph which only has mutual edges)

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

    Definition Classes

    AnyRef → Any

25. def getProbEdgeRandomDirected(numNodes: Int, avgOutDegree: Int): Double

    returns

    Probability of existence of an edge in a random E-R graph.

26. def hashCode(): Int

    Definition Classes

    AnyRef → Any

27. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

29. val nodeSeqIterator: () ⇒ Iterator[NodeIdEdgesMaxId]

30. val nodeSeqIterator2: () ⇒ Iterator[NodeIdEdgesMaxId]

31. final def notify(): Unit

    Definition Classes

    AnyRef

32. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

34. def toString(): String

    Definition Classes

    AnyRef → Any

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