BrandesExample

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. lazy val betweennesses: Map[String, Double]

   

   The second item in the tuple holds the betweenness for the graph.

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. lazy val edges: Seq[(String, String, String)]

   

   Edges are just a Seq of Tuple3[Node,Node,Edge]

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. lazy val labelDigraph: AdjacencyLabelDigraph[String, Label]

    

    The helper methods in AllPathsFirstSteps need a directed graph.

    The helper methods in AllPathsFirstSteps need a directed graph. Use AllPathsFirstSteps.semiring's annihilator - None - for noEdgeExistsValue.

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

    

    Definition Classes

    AnyRef

16. lazy val nodeOrder: Array[String]

    

    The labels from Brandes use node indexes from a directed graph, so it's best to control those via the optional nodeOrder parameter

17. final def notify(): Unit

    

    Definition Classes

    AnyRef

18. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

19. lazy val paths: Seq[Seq[InnerNodeType]]

    

    Or just get the shortest paths

20. lazy val shortPathLabels: IndexedSeq[(String, String, Option[BrandesSteps[String, Int]])]

    

    The first item in the tuple holds edges labels.

21. lazy val shortestPathsAndBetweenness: (IndexedSeq[(String, String, Option[BrandesSteps[String, Int]])], Map[String, Double])

    

    Find shortest paths and betweenness for the graph

22. lazy val shortestPathsAndBetweennessFromPar: (ParSeq[(String, String, Option[BrandesSteps[String, Int]])], ParMap[String, Double])

    

    Find shortest paths and betweenness for the graph in parallel

23. lazy val subgraph: Set[InnerEdgeType]

    

    Get a subgraph that holds all the possible shortest paths

24. lazy val support: BrandesSupport[String, Int, Int]

    

    BrandesSupport has some helper methods to generate the shortest paths.

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

    

    Definition Classes

    AnyRef

26. def toString(): String

    

    Definition Classes

    AnyRef → Any

27. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )