generic

Type Members

1. class AnyOrdering[N] extends Ordering[N]

   

   Ordering for Any with the following rules: numerical > string > any other reference type.

   Ordering for Any with the following rules: numerical > string > any other reference type. If a reference type is not a subclass of Ordered, it will be ordered according to its toString value.

2. trait GraphCompanion[+CC[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], CC]] extends AnyRef

   

   Methods common to Graph companion objects in the core module.

   Methods common to Graph companion objects in the core module.

   CC

   the kind of type of the graph that is to become the companion class/trait of the object extending this trait.

3. trait GraphCoreCompanion[+CC[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], CC]] extends GraphCompanion[CC]

   

   GraphCompanion extended to work with CoreConfig.

4. trait GroupIterator[A] extends Iterator[A]

   

   Iterator facilitating group-wise iteration over two ore more levels.

   Iterator facilitating group-wise iteration over two ore more levels. Each level is represented by an inner iterator. Interactions between these levels are handled internally thus the implementor just needs to define the individual level iterators. Level iterator implementations will typically be inner objects inheriting from the public inner traits of this trait.

   This trait is not graph-specific.

   A

   Simple or composite type of elements being subject to the iteration. For instance, a two-level iteration could expose just the elements of the inner loop or both the outer and the inner loop elements as a tuple.

5. trait ImmutableGraphCompanion[+CC[N, E[X] <: EdgeLikeIn[X]] <: immutable.Graph[N, E[X]] with GraphLike[N, E[X], CC]] extends GraphCoreCompanion[CC]

   

6. trait MutableGraphCompanion[+CC[N, E[X] <: EdgeLikeIn[X]] <: mutable.Graph[N, E[X]] with mutable.GraphLike[N, E[X], CC]] extends GraphCoreCompanion[CC]