axle.graph.JungDirectedGraph

Ordering

Alphabetic
By inheritance

Inherited

Hide All
Show all

JungDirectedGraph
Serializable
Serializable
Product
Equals
DirectedGraph
AnyRef
Any

Visibility

Public
All

Instance Constructors

new JungDirectedGraph (vps: Seq[VP], ef: (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)])

Type Members

type ES = (Vertex[VP], Vertex[VP], EP)

Definition Classes
JungDirectedGraph → DirectedGraph
type G [VP, EP] = JungDirectedGraph[VP, EP]

Definition Classes
JungDirectedGraph → DirectedGraph

Value Members

def != (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def != (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
def ## (): Int

Attributes
final
Definition Classes
AnyRef → Any
def == (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def == (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
def _ancestors (v: Vertex[VP], result: Set[Vertex[VP]]): Unit

Definition Classes
DirectedGraph
def _descendants (v: Vertex[VP], result: Set[Vertex[VP]]): Unit

Definition Classes
DirectedGraph
def allEdges (): Set[Edge[(), EP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def ancestors (vs: Set[Vertex[VP]]): Set[Vertex[VP]]

Definition Classes
DirectedGraph
def ancestors (v: Vertex[VP]): Set[Vertex[VP]]

Definition Classes
DirectedGraph
def asInstanceOf [T0] : T0

Attributes
final
Definition Classes
Any
def canEqual (arg0: Any): Boolean

Definition Classes
JungDirectedGraph → Equals
def clone (): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def deleteEdge (e: Edge[(), EP]): JungDirectedGraph[VP, EP]
def deleteVertex (v: Vertex[VP]): JungDirectedGraph[VP, EP]

Definition Classes
JungDirectedGraph → DirectedGraph
def descendants (v: Vertex[VP]): Set[Vertex[VP]]

Definition Classes
DirectedGraph
def descendantsIntersectsSet (v: Vertex[VP], s: Set[Vertex[VP]]): Boolean

Definition Classes
JungDirectedGraph → DirectedGraph
def dest (edge: Edge[(), EP]): Vertex[VP]

Definition Classes
JungDirectedGraph → DirectedGraph
val edgePayloadFunction : (()) ⇒ EP
val ef : (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]
def eq (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def equals (arg0: Any): Boolean

Definition Classes
JungDirectedGraph → Equals → AnyRef → Any
def filterEdges (f: ((Vertex[VP], Vertex[VP], EP)) ⇒ Boolean): JungDirectedGraph[VP, EP]
def finalize (): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def findEdge (from: Vertex[VP], to: Vertex[VP]): Option[Edge[(), EP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def findVertex (f: (Vertex[VP]) ⇒ Boolean): Option[Vertex[VP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def getClass (): java.lang.Class[_]

Attributes
final
Definition Classes
AnyRef → Any
def hashCode (): Int

Definition Classes
JungDirectedGraph → AnyRef → Any
def isAcyclic (): Boolean

Definition Classes
JungDirectedGraph → DirectedGraph
def isInstanceOf [T0] : Boolean

Attributes
final
Definition Classes
Any
def isLeaf (v: Vertex[VP]): Boolean

Definition Classes
JungDirectedGraph → DirectedGraph
lazy val jungGraph : DirectedSparseGraph[Vertex[VP], Edge[(), EP]]
def leaves (): Set[Vertex[VP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def map [NVP, NEP] (vpf: (VP) ⇒ NVP, epf: (EP) ⇒ NEP): JungDirectedGraph[NVP, NEP]
def moralGraph (): Null
def ne (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def neighbors (v: Vertex[VP]): Set[Vertex[VP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def notify (): Unit

Attributes
final
Definition Classes
AnyRef
def notifyAll (): Unit

Attributes
final
Definition Classes
AnyRef
def outputEdgesOf (v: Vertex[VP]): Set[Edge[(), EP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def precedes (v1: Vertex[VP], v2: Vertex[VP]): Boolean

Definition Classes
JungDirectedGraph → DirectedGraph
def predecessors (v: Vertex[VP]): Set[Vertex[VP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def productArity : Int

Definition Classes
JungDirectedGraph → Product
def productElement (arg0: Int): Any

Definition Classes
JungDirectedGraph → Product
def productIterator : Iterator[Any]

Definition Classes
Product
def productPrefix : String

Definition Classes
JungDirectedGraph → Product
def removeInputs (to: Set[Vertex[VP]]): JungDirectedGraph[VP, EP]
def removeOutputs (from: Set[Vertex[VP]]): JungDirectedGraph[VP, EP]
def shortestPath (source: Vertex[VP], goal: Vertex[VP]): Option[List[Edge[(), EP]]]

Definition Classes
JungDirectedGraph → DirectedGraph
def size (): Int

Definition Classes
JungDirectedGraph → DirectedGraph
def source (edge: Edge[(), EP]): Vertex[VP]

Definition Classes
JungDirectedGraph → DirectedGraph
def storage (): DirectedSparseGraph[Vertex[VP], Edge[(), EP]]
def successors (v: Vertex[VP]): Set[Vertex[VP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def synchronized [T0] (arg0: ⇒ T0): T0

Attributes
final
Definition Classes
AnyRef
def toString (): String

Definition Classes
JungDirectedGraph → AnyRef → Any
lazy val vertexSeq : Seq[Vertex[VP]]
lazy val vertexSet : Set[Vertex[VP]]
def vertexToVisualizationHtml (vp: VP): Node
def vertices (): Set[Vertex[VP]]

Definition Classes
JungDirectedGraph → DirectedGraph
def verticesSeq (): Seq[Vertex[VP]]
val vps : Seq[VP]
def wait (): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long, arg1: Int): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()

Deprecated Value Members

def productElements : Iterator[Any]

Definition Classes
Product
Annotations
@deprecated
Deprecated
use productIterator instead

JungDirectedGraph

case class JungDirectedGraph [VP, EP] (vps: Seq[VP], ef: (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]) extends DirectedGraph[VP, EP] with Product with Serializable

Instance Constructors

new JungDirectedGraph (vps: Seq[VP], ef: (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)])

Type Members

type ES = (Vertex[VP], Vertex[VP], EP)

type G [VP, EP] = JungDirectedGraph[VP, EP]

Value Members

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def _ancestors (v: Vertex[VP], result: Set[Vertex[VP]]): Unit

def _descendants (v: Vertex[VP], result: Set[Vertex[VP]]): Unit

def allEdges (): Set[Edge[(), EP]]

def ancestors (vs: Set[Vertex[VP]]): Set[Vertex[VP]]

def ancestors (v: Vertex[VP]): Set[Vertex[VP]]

def asInstanceOf [T0] : T0

def canEqual (arg0: Any): Boolean

def clone (): AnyRef

def deleteEdge (e: Edge[(), EP]): JungDirectedGraph[VP, EP]

def deleteVertex (v: Vertex[VP]): JungDirectedGraph[VP, EP]

def descendants (v: Vertex[VP]): Set[Vertex[VP]]

def descendantsIntersectsSet (v: Vertex[VP], s: Set[Vertex[VP]]): Boolean

def dest (edge: Edge[(), EP]): Vertex[VP]

val edgePayloadFunction : (()) ⇒ EP

val ef : (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def filterEdges (f: ((Vertex[VP], Vertex[VP], EP)) ⇒ Boolean): JungDirectedGraph[VP, EP]

def finalize (): Unit

def findEdge (from: Vertex[VP], to: Vertex[VP]): Option[Edge[(), EP]]

def findVertex (f: (Vertex[VP]) ⇒ Boolean): Option[Vertex[VP]]

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

def hashCode (): Int

def isAcyclic (): Boolean

def isInstanceOf [T0] : Boolean

def isLeaf (v: Vertex[VP]): Boolean

lazy val jungGraph : DirectedSparseGraph[Vertex[VP], Edge[(), EP]]

def leaves (): Set[Vertex[VP]]

def map [NVP, NEP] (vpf: (VP) ⇒ NVP, epf: (EP) ⇒ NEP): JungDirectedGraph[NVP, NEP]

def moralGraph (): Null

def ne (arg0: AnyRef): Boolean

def neighbors (v: Vertex[VP]): Set[Vertex[VP]]

def notify (): Unit

def notifyAll (): Unit

def outputEdgesOf (v: Vertex[VP]): Set[Edge[(), EP]]

def precedes (v1: Vertex[VP], v2: Vertex[VP]): Boolean

def predecessors (v: Vertex[VP]): Set[Vertex[VP]]

def productArity : Int

def productElement (arg0: Int): Any

def productIterator : Iterator[Any]

def productPrefix : String

def removeInputs (to: Set[Vertex[VP]]): JungDirectedGraph[VP, EP]

def removeOutputs (from: Set[Vertex[VP]]): JungDirectedGraph[VP, EP]

def shortestPath (source: Vertex[VP], goal: Vertex[VP]): Option[List[Edge[(), EP]]]

def size (): Int

def source (edge: Edge[(), EP]): Vertex[VP]

def storage (): DirectedSparseGraph[Vertex[VP], Edge[(), EP]]

def successors (v: Vertex[VP]): Set[Vertex[VP]]

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

def toString (): String

lazy val vertexSeq : Seq[Vertex[VP]]

lazy val vertexSet : Set[Vertex[VP]]

def vertexToVisualizationHtml (vp: VP): Node

def vertices (): Set[Vertex[VP]]

def verticesSeq (): Seq[Vertex[VP]]

val vps : Seq[VP]

def wait (): Unit

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

def wait (arg0: Long): Unit

Deprecated Value Members

def productElements : Iterator[Any]

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from DirectedGraph[VP, EP]

Inherited from AnyRef