WRGraph

abstract def glinks: Seq[L]

abstract def glinks_=(s: Seq[L]): Unit

final def !=(arg0: Any): Boolean

final def ##(): Int

def +-:[T <: (WRGraph.this)#W](z: T)(implicit linkFactory: (WRGraph.this)#LFactory): T

add a new dependency - this allows x +- y -- z to mean what you thinbk it should

def +->[T <: N](z: Seq[T])(implicit linkFactory: (WRGraph.this)#LFactory): N

add a new par depy a -> (b,c)

def +->[T <: N](z: T)(implicit linkFactory: (WRGraph.this)#LFactory): N

add a new dependency

def --:[T <: (WRGraph.this)#W](z: T)(implicit linkFactory: (WRGraph.this)#LFactory): T

reroute - this allows x --: y --: z to mean what you thinbk it should

def -->[T <: N](z: Seq[T])(implicit linkFactory: (WRGraph.this)#LFactory): N

par depy a -> (b,c)

def -->[T <: N](z: T)(implicit linkFactory: (WRGraph.this)#LFactory): N

reroute all links to z - x --> y --> z doens't mean what you may think, see --:

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def mkString: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit