Brandes

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. object BrandesSupport extends Serializable

   

5. def allLeastPathsAndBetweenness[Node, EdgeLabel, CoreLabel, Key](edges: GenTraversable[(Node, Node, EdgeLabel)], nodeOrder: GenSeq[Node] = Seq.empty, coreSupport: SemiringSupport[CoreLabel, Key] = FewestNodes, labelForEdge: (Node, Node, EdgeLabel) ⇒ CoreLabel = FewestNodes.edgeToLabelConverter): (IndexedSeq[(Node, Node, Option[BrandesSteps[Node, CoreLabel]])], Map[Node, Double])

   

   This method runs Dijkstra's algorithm and finds betweenness for all nodes in the label graph.

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. def brandesDijkstra[Node, Label, Key](labelDigraph: IndexedLabelDigraph[Node, Label], support: SemiringSupport[Label, Key])(sink: InnerNodeType): (IndexedSeq[(Node, Node, Label)], Stack[(InnerNodeType, Label)])

   

   Dijkstra's algorithm for a single sink, with a Seq of visited edges to support Brandes' algorithm.

   Dijkstra's algorithm for a single sink, with a Seq of visited edges to support Brandes' algorithm.

   O(n ln(n) + a)

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def createLabelDigraph[Node, EdgeLabel, CoreLabel, Key](edges: GenTraversable[(Node, Node, EdgeLabel)] = Seq.empty, nodeOrder: GenSeq[Node] = Seq.empty, support: BrandesSupport[Node, CoreLabel, Key], labelForEdge: (Node, Node, EdgeLabel) ⇒ CoreLabel): IndexedLabelDigraph[Node, Option[BrandesSteps[Node, CoreLabel]]]

   

   Create a digraph of Labels from an edge list.

   Create a digraph of Labels from an edge list.

   returns

   an IndexedDigraph with graph's nodes, a self-edge for each node with the semiring's identifier, and an edge for each edge specified by labelForEdge.

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

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

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. def parAllLeastPathsAndBetweenness[Node, EdgeLabel, CoreLabel, Key](edges: GenTraversable[(Node, Node, EdgeLabel)], nodeOrder: GenSeq[Node] = Seq.empty, coreSupport: SemiringSupport[CoreLabel, Key] = FewestNodes, labelForEdge: (Node, Node, EdgeLabel) ⇒ CoreLabel = FewestNodes.edgeToLabelConverter): (ParSeq[(Node, Node, Option[BrandesSteps[Node, CoreLabel]])], ParMap[Node, Double])

    

    This method runs Dijkstra's algorithm and finds betweenness for all nodes in the label graph.

20. def partialBetweenness[Node, CoreLabel, Label <: Option[BrandesSteps[Node, CoreLabel]], Key](support: BrandesSupport[Node, CoreLabel, Key], labelGraph: IndexedLabelDigraph[Node, Label])(sink: InnerNodeType, stack: Stack[(InnerNodeType, Label)], shortestPathsToSink: IndexedSeq[(Node, Node, Label)]): IndexedSeq[Double]

    

    Find partial betweenness

    Find partial betweenness

    O(a)

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

    

    Definition Classes

    AnyRef

22. def toString(): String

    

    Definition Classes

    AnyRef → Any

23. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )