NativeDirectedGraph

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

lazy val _edges : Seq[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

lazy val _edgesSet : Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

def _shortestPath (source: Vertex[VP], goal: Vertex[VP], visited: Set[Vertex[VP]]): Option[List[Edge[(), EP]]]

shortestPath

lazy val _vertices : Seq[Vertex[VP]]

lazy val _verticesSet : Set[Vertex[VP]]

def allEdges (): Set[Edge[(Vertex[VP], Vertex[VP], EP), 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]): NativeDirectedGraph[VP, EP]

def deleteVertex (v: Vertex[VP]): NativeDirectedGraph[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): NativeDirectedGraph[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

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

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]]): NativeDirectedGraph[VP, EP]

def removeOutputs (from: Set[Vertex[VP]]): NativeDirectedGraph[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 (): (Set[Vertex[VP]], Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]], Map[Vertex[VP], Set[Edge[(), EP]]], Map[Vertex[VP], Set[Edge[(), EP]]])

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

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

def toString (): String

lazy val vertex2inedges : Map[Vertex[VP], Set[Edge[(), EP]]]

lazy val vertex2outedges : Map[Vertex[VP], Set[Edge[(), EP]]]

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

val vps : Seq[VP]

def wait (): Unit

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

def wait (arg0: Long): Unit

def productElements : Iterator[Any]