TestGraphs

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def bipartiteGraphDoubleSide: BipartiteGraph

   

6. def bipartiteGraphSingleSide: BipartiteGraph

   

7. def bipartiteGraphWithUniqueNodeIds: BipartiteGraph

   

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def dangling_g7: ArrayBasedDirectedGraph

   

10. def dangling_g7_in: ArrayBasedDirectedGraph

    

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

    

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

14. val g1: TestGraph

    

15. val g2_mutual: TestGraph

    

16. val g2_nonmutual: TestGraph

    

17. def g3: ArrayBasedDirectedGraph

    

18. val g3_dangling_in: ArrayBasedDirectedGraph

    

19. val g3_dangling_out: ArrayBasedDirectedGraph

    

20. val g3_dangling_seq: Seq[NodeIdEdgesMaxId]

    

21. def g5: ArrayBasedDirectedGraph

    

22. def g6: ArrayBasedDirectedGraph

    

23. def g6WithEmptyNodes: ArrayBasedDirectedGraph

    

24. def g6_onlyin: ArrayBasedDirectedGraph

    

25. def g6_onlyout: ArrayBasedDirectedGraph

    

26. def g7_onlyin: ArrayBasedDirectedGraph

    

27. def g7_onlyout: ArrayBasedDirectedGraph

    

28. def generateCompleteGraph(numNodes: Int): TestGraph

    

29. def generateRandomGraph(numNodes: Int, probEdge: Double, graphDir: StoredGraphDir = StoredGraphDir.BothInOut, rand: Random = new Random): 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

30. def generateRandomUndirectedGraph(numNodes: Int, probEdge: Double, graphDir: StoredGraphDir = StoredGraphDir.BothInOut, rand: Random = new Random, parallelismLimit: Int = 2): 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)

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

    

    Definition Classes

    AnyRef → Any

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

    
    returns

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

33. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

34. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

36. val nodeSeqIterator: Seq[NodeIdEdgesMaxId]

    

37. val nodeSeqIterator2: Seq[NodeIdEdgesMaxId]

    

38. val nodeSeqIteratorWithEmpty: Seq[NodeIdEdgesMaxId]

    

39. final def notify(): Unit

    

    Definition Classes

    AnyRef

40. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

42. def toString(): String

    

    Definition Classes

    AnyRef → Any

43. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )