object Edge extends Serializable
- Annotations
- @transient()
- Alphabetic
- By Inheritance
- Edge
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply(innerEdge: E[NodeT]): EdgeT
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def defaultWeight(edge: EdgeT): Double
-
def
edgeToEdgeCont(edge: E[N]): E[NodeT]
Creates a new inner edge from the outer
edge
using its factory methodcopy
without modifying the node or edge set.Creates a new inner edge from the outer
edge
using its factory methodcopy
without modifying the node or edge set.- Attributes
- protected[scalax.collection.GraphBase]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- implicit final def innerEdgeToEdgeCont(edge: EdgeT): E[NodeT]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def mkNodes(node_1: N, node_2: N, nodes: N*): Product
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def unapply(e: EdgeT): Some[EdgeT]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def weightOrdering(weightF: (EdgeT) ⇒ Double): Ordering[EdgeT]
- def weightOrdering[T](weightF: (EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Ordering[EdgeT]
- object ArityOrdering extends Ordering[EdgeT]
- object WeightOrdering extends Ordering[EdgeT]
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.