axle.stats

Model

trait Model [MVP] extends JungDirectedGraph[MVP, String]

Linear Supertypes
JungDirectedGraph[MVP, String], DirectedGraph[MVP, String], Graph[MVP, String], AnyRef, Any
Known Subclasses
BayesianNetwork, CausalModel
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Model
  2. JungDirectedGraph
  3. DirectedGraph
  4. Graph
  5. AnyRef
  6. Any
Visibility
  1. Public
  2. All

Type Members

  1. trait DirectedGraphEdge [P] extends GraphEdge[P]

  2. trait DirectedGraphVertex [P] extends GraphVertex[P]

  3. type E = JungDirectedGraphEdge[String]

    Definition Classes
    JungDirectedGraph → DirectedGraph → Graph

  4. trait GraphEdge [P] extends AnyRef

  5. trait GraphVertex [P] extends AnyRef

  6. trait JungDirectedGraphEdge [P] extends DirectedGraphEdge[P]

  7. class JungDirectedGraphEdgeImpl extends JungDirectedGraphEdge[EP]

  8. trait JungDirectedGraphVertex [P] extends DirectedGraphVertex[P]

  9. class JungDirectedGraphVertexImpl extends JungDirectedGraphVertex[VP]

  10. type S = DirectedSparseGraph[V, E]

    Definition Classes
    JungDirectedGraph → Graph

  11. type V = JungDirectedGraphVertex[MVP]

    Definition Classes
    JungDirectedGraph → DirectedGraph → Graph

Abstract Value Members

  1. def name (): String

    Attributes
    abstract

  2. def vertexPayloadToRandomVariable (mvp: MVP): axle.stats.RandomVariable[_]

    Attributes
    abstract

Concrete Value Members

  1. def != (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  2. def != (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  3. def ## (): Int

    Attributes
    final
    Definition Classes
    AnyRef → Any

  4. def ++= (vps: Seq[MVP]): Seq[V]

    Definition Classes
    Graph

  5. def += (vp: MVP): V

    Definition Classes
    Graph

  6. def += (vs: (V, V), ep: String): E

    Definition Classes
    Graph

  7. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  8. def == (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  9. def _ancestors (v: V, result: Set[V]): Unit

    Definition Classes
    DirectedGraph

  10. def _descendants (v: V, result: Set[V]): Unit

    Definition Classes
    DirectedGraph

  11. def _findOpenPath (visited: Map[axle.stats.RandomVariable[_], Set[axle.stats.RandomVariable[_]]], priorDirection: Int, prior: axle.stats.RandomVariable[_], current: Set[axle.stats.RandomVariable[_]], to: Set[axle.stats.RandomVariable[_]], given: Set[axle.stats.RandomVariable[_]]): Option[List[axle.stats.RandomVariable[_]]]

  12. def ancestors (vs: Set[V]): Set[V]

    Definition Classes
    DirectedGraph

  13. def ancestors (v: V): Set[V]

    Definition Classes
    DirectedGraph

  14. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  15. def blocks (from: Set[axle.stats.RandomVariable[_]], to: Set[axle.stats.RandomVariable[_]], given: Set[axle.stats.RandomVariable[_]]): Boolean

  16. def clone (): AnyRef

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

  17. def deleteEdge (e: E): Unit

    Definition Classes
    JungDirectedGraph → DirectedGraph

  18. def deleteVertex (v: V): Unit

    Definition Classes
    JungDirectedGraph → DirectedGraph

  19. def descendants (v: V): Set[V]

    Definition Classes
    DirectedGraph

  20. def descendantsIntersectsSet (v: V, s: Set[V]): Boolean

    Definition Classes
    JungDirectedGraph → DirectedGraph

  21. def edge (source: V, dest: V, payload: String): E

    Definition Classes
    JungDirectedGraph → Graph

  22. def edges (): Set[E]

    Definition Classes
    JungDirectedGraph → Graph

  23. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  24. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  25. def finalize (): Unit

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

  26. def findEdge (from: V, to: V): Option[E]

    Definition Classes
    JungDirectedGraph → DirectedGraph

  27. def findVertex (test: (MVP) ⇒ Boolean): Option[V]

    Definition Classes
    JungDirectedGraph

  28. def getClass (): java.lang.Class[_]

    Attributes
    final
    Definition Classes
    AnyRef → Any

  29. def hashCode (): Int

    Definition Classes
    AnyRef → Any

  30. def isAcyclic (): Boolean

    Definition Classes
    JungDirectedGraph → DirectedGraph

  31. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  32. def isLeaf (v: V): Boolean

    Definition Classes
    JungDirectedGraph → DirectedGraph

  33. val jungGraph : DirectedSparseGraph[V, E]

    Definition Classes
    JungDirectedGraph

  34. def leaves (): Set[V]

    Definition Classes
    JungDirectedGraph → DirectedGraph

  35. def moralGraph (): axle.graph.JungUndirectedGraphFactory.UndirectedGraph[_, _]

    Definition Classes
    JungDirectedGraph

  36. val name2variable : Map[String, axle.stats.RandomVariable[_]]

  37. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  38. def neighbors (v: V): Set[V]

    Definition Classes
    JungDirectedGraph → DirectedGraph

  39. var newVarIndex : Int

  40. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  41. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  42. def numVariables (): Int

  43. def outputEdgesOf (v: V): Set[E]

    Definition Classes
    JungDirectedGraph → DirectedGraph

  44. def precedes (v1: V, v2: V): Boolean

    Definition Classes
    JungDirectedGraph → DirectedGraph

  45. def predecessors (v: V): Set[V]

    Definition Classes
    JungDirectedGraph → DirectedGraph

  46. def randomVariables (): List[axle.stats.RandomVariable[_]]

  47. def removeAllEdgesAndVertices (): Unit

    Definition Classes
    JungDirectedGraph

  48. def removeInputs (vs: Set[V]): Unit

    Definition Classes
    JungDirectedGraph → DirectedGraph

  49. def removeOutputs (vs: Set[V]): Unit

    Definition Classes
    JungDirectedGraph → DirectedGraph

  50. def removePredecessor (v: V, predecessor: V): Unit

    Definition Classes
    JungDirectedGraph → DirectedGraph

  51. def removeSuccessor (v: V, successor: V): Unit

    Definition Classes
    JungDirectedGraph → DirectedGraph

  52. def shortestPath (source: V, goal: V): Option[List[E]]

    Definition Classes
    JungDirectedGraph → DirectedGraph

  53. def size (): Int

    Definition Classes
    JungDirectedGraph → Graph

  54. def storage (): DirectedSparseGraph[V, E]

    Definition Classes
    JungDirectedGraph → Graph

  55. def successors (v: V): Set[V]

    Definition Classes
    JungDirectedGraph → DirectedGraph

  56. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef

  57. def toString (): String

    Definition Classes
    AnyRef → Any

  58. def variable (name: String): axle.stats.RandomVariable[_]

  59. def vertex (payload: MVP): V

    Definition Classes
    JungDirectedGraph → Graph

  60. def vertexToVisualizationHtml (vp: MVP): Node

    Definition Classes
    JungDirectedGraph

  61. def vertices (): Set[V]

    Definition Classes
    JungDirectedGraph → Graph

  62. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  64. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from JungDirectedGraph[MVP, String]

Inherited from DirectedGraph[MVP, String]

Inherited from Graph[MVP, String]

Inherited from AnyRef

Inherited from Any