axle.graph.JungDirectedGraphFactory

JungDirectedGraph

trait JungDirectedGraph [VP, EP] extends DirectedGraph[VP, EP]

Linear Supertypes
DirectedGraph[VP, EP], Graph[VP, EP], AnyRef, Any
Known Subclasses
BayesianNetwork, CausalModel, Model
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. JungDirectedGraph
  2. DirectedGraph
  3. Graph
  4. AnyRef
  5. 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[EP]

    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[VP]

    Definition Classes
    JungDirectedGraph → DirectedGraph → Graph

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[VP]): Seq[V]

    Definition Classes
    Graph

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

    Definition Classes
    Graph

  6. def += (vs: (V, V), ep: EP): 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 ancestors (vs: Set[V]): Set[V]

    Definition Classes
    DirectedGraph

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

    Definition Classes
    DirectedGraph

  13. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  14. def clone (): AnyRef

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

  15. def deleteEdge (e: E): Unit

    Definition Classes
    JungDirectedGraph → DirectedGraph

  16. def deleteVertex (v: V): Unit

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  19. def edge (source: V, dest: V, payload: EP): E

    Definition Classes
    JungDirectedGraph → Graph

  20. def edges (): Set[E]

    Definition Classes
    JungDirectedGraph → Graph

  21. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  22. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  23. def finalize (): Unit

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

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  25. def findVertex (test: (VP) ⇒ Boolean): Option[V]

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

    Attributes
    final
    Definition Classes
    AnyRef → Any

  27. def hashCode (): Int

    Definition Classes
    AnyRef → Any

  28. def isAcyclic (): Boolean

    Definition Classes
    JungDirectedGraph → DirectedGraph

  29. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  30. def isLeaf (v: V): Boolean

    Definition Classes
    JungDirectedGraph → DirectedGraph

  31. val jungGraph : DirectedSparseGraph[V, E]

  32. def leaves (): Set[V]

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

  34. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  36. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  37. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  41. def removeAllEdgesAndVertices (): Unit

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  47. def size (): Int

    Definition Classes
    JungDirectedGraph → Graph

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

    Definition Classes
    JungDirectedGraph → Graph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Attributes
    final
    Definition Classes
    AnyRef

  51. def toString (): String

    Definition Classes
    AnyRef → Any

  52. def vertex (payload: VP): V

    Definition Classes
    JungDirectedGraph → Graph

  53. def vertexToVisualizationHtml (vp: VP): Node

  54. def vertices (): Set[V]

    Definition Classes
    JungDirectedGraph → Graph

  55. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  57. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from DirectedGraph[VP, EP]

Inherited from Graph[VP, EP]

Inherited from AnyRef

Inherited from Any