junto.graph

MadGraphRunner

object MadGraphRunner

An implementation of MAD using Akka actors. Still preliminary -- has some things to add in yet, and round out, but the core algorithm is working properly. There are many things that can surely be improved, especially to reducing the amount of blocking employed here.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MadGraphRunner
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. case class Advance(worker: ActorRef) extends MadMessage with Product with Serializable

  2. class Clock extends Actor

    A time keeper that makes sure that each iteration is distinct from the next, by ensuring that the graph controller (MadGraph actor) doesn't broadcast the next label pushing event until all vertices are done updating.

  3. case class DoneUpdating(delta: Double, mrr: Double) extends MadMessage with Product with Serializable

  4. class MadGraph extends Actor

    An actor that controls the entire graph.

  5. sealed trait MadMessage extends AnyRef

  6. class MadVertex extends Actor

    An actor for a vertex.

  7. case class NeighborInfo(neighbor: ActorRef, nPcontinue: Double, nWeightOfRecipent: Double, labelDist: Map[String, Double]) extends Product with Serializable

  8. case class SetNeighbors(neighbors: Map[ActorRef, Double]) extends MadMessage with Product with Serializable

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. object NextStep extends MadMessage with Product with Serializable

  7. object PushLabels extends MadMessage with Product with Serializable

  8. object Stop extends MadMessage with Product with Serializable

  9. def apply(graph: Graph, mu1: Double, mu2: Double, mu3: Double, maxIters: Int): Unit

    Entry point into actor-based MAD: create the actors for the graph and its vertices and start the work.

  10. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  11. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef → Any

  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

Inherited from AnyRef

Inherited from Any

Ungrouped