scalax.collection.generic

Members list

Type members

Classlikes

case object %

Intermediate infix extractor for the "unlabeled part" of a weighted edge. It is to be combined with :~ or :~> like case a :~ b % w.

Intermediate infix extractor for the "unlabeled part" of a weighted edge. It is to be combined with :~ or :~> like case a :~ b % w.

Attributes

Supertypes
trait Singleton
trait Product
trait Mirror
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
Self type
%.type
abstract class AbstractDiEdge[+N](val source: N, val target: N) extends AnyDiEdge[N]

Attributes

Supertypes
trait AnyDiEdge[N]
trait AnyEdge[N]
trait AnyDiHyperEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
trait AbstractDiEdgeImplicits[N, E <: (AnyDiEdge), C <: EdgeCompanion[E]]

Attributes

Supertypes
class Any
Known subtypes
class DiEdgeImplicits[N]
abstract class AbstractDiHyperEdge[+N](val sources: OneOrMore[N], val targets: OneOrMore[N]) extends AnyDiHyperEdge[N]

Attributes

Companion
object
Supertypes
trait AnyDiHyperEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class DiHyperEdge[N]
class DiHyperEdge[N]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
Show all

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type
trait AbstractEdgeImplicits[N, E <: ([X] =>> Edge[X] & AnyEdge[X]), C <: EdgeCompanion[E]]

Attributes

Supertypes
class Any
Known subtypes

Attributes

Supertypes
trait GenericEdgeMapper[CC]
trait AnyDiEdge[N]
trait AnyEdge[N]
trait AnyDiHyperEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class WDiEdge[N]
class WDiEdge[N]
abstract class AbstractGenericDiHyperEdge[+N, +CC <: (AbstractGenericDiHyperEdge)](sources: OneOrMore[N], targets: OneOrMore[N]) extends AbstractDiHyperEdge[N], GenericDiHyperEdgeMapper[CC]

Attributes

Supertypes
trait AnyDiHyperEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all

Attributes

Supertypes
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all

Attributes

Supertypes
trait GenericEdgeMapper[CC]
trait AnyUnDiEdge[N]
trait AnyEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class WUnDiEdge[N]
class WUnDiEdge[N]

Attributes

Supertypes
trait GenericEdgeMapper[CC]
trait AnyDiEdge[N]
trait AnyEdge[N]
trait AnyDiHyperEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class DiEdge[N]

Attributes

Supertypes
trait AnyDiHyperEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class DiHyperEdge[N]
class DiHyperEdge[N]

Attributes

Supertypes
trait GenericEdgeMapper[CC]
trait AnyUnDiEdge[N]
trait AnyEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class UnDiEdge[N]
abstract class AbstractHyperEdge[+N](val ends: Several[N]) extends AnyHyperEdge[N]

Attributes

Companion
object
Supertypes
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class HyperEdge[N]
class HyperEdge[N]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
Show all

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type
abstract class AbstractUnDiEdge[+N](val source: N, val target: N) extends AnyUnDiEdge[N]

Attributes

Supertypes
trait AnyUnDiEdge[N]
trait AnyEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all

Attributes

Supertypes
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class HyperEdge[N]
class HyperEdge[N]
trait AnyDiEdge[+N] extends AnyDiHyperEdge[N], AnyEdge[N]

Attributes

Supertypes
trait AnyEdge[N]
trait AnyDiHyperEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class LDiEdge[N, L]
class LDiEdge[N, L]
class AbstractDiEdge[N]
trait AbstractGenericDiEdge[N, CC]
class WDiEdge[N]
class WDiEdge[N]
class DiEdge[N]
Show all
trait AnyDiHyperEdge[+N] extends AnyHyperEdge[N]

Attributes

Companion
object
Supertypes
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class DiHyperEdge[N]
class DiHyperEdge[N]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
trait AnyDiEdge[N]
class LDiEdge[N, L]
class LDiEdge[N, L]
class AbstractDiEdge[N]
trait AbstractGenericDiEdge[N, CC]
class WDiEdge[N]
class WDiEdge[N]
class DiEdge[N]
Show all

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
trait AnyEdge[+N] extends Edge[N]

Attributes

Companion
object
Supertypes
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Known subtypes
trait AnyDiEdge[N]
class LDiEdge[N, L]
class LDiEdge[N, L]
class AbstractDiEdge[N]
trait AbstractGenericDiEdge[N, CC]
class WDiEdge[N]
class WDiEdge[N]
class DiEdge[N]
trait AnyUnDiEdge[N]
class LUnDiEdge[N, L]
class LUnDiEdge[N, L]
class WUnDiEdge[N]
class WUnDiEdge[N]
class UnDiEdge[N]
class AbstractUnDiEdge[N]
Show all
object AnyEdge

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
AnyEdge.type
trait AnyHyperEdge[+N] extends Edge[N]

Attributes

Companion
object
Supertypes
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Known subtypes
class HyperEdge[N]
class HyperEdge[N]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
trait AnyDiHyperEdge[N]
class DiHyperEdge[N]
class DiHyperEdge[N]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
trait AnyDiEdge[N]
class LDiEdge[N, L]
class LDiEdge[N, L]
class AbstractDiEdge[N]
trait AbstractGenericDiEdge[N, CC]
class WDiEdge[N]
class WDiEdge[N]
class DiEdge[N]
trait AnyUnDiEdge[N]
class LUnDiEdge[N, L]
class LUnDiEdge[N, L]
class WUnDiEdge[N]
class WUnDiEdge[N]
class UnDiEdge[N]
class AbstractUnDiEdge[N]
Show all
object AnyHyperEdge

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
class AnyOrdering[N] extends Ordering[N]

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. Used to predictably order elements when computing Graph.toString.

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. Used to predictably order elements when computing Graph.toString.

Attributes

Supertypes
trait Ordering[N]
trait PartialOrdering[N]
trait Equiv[N]
trait Serializable
trait Comparator[N]
class Object
trait Matchable
class Any
Show all
trait AnyUnDiEdge[+N] extends AnyHyperEdge[N], AnyEdge[N]

Attributes

Companion
object
Supertypes
trait AnyEdge[N]
trait AnyHyperEdge[N]
trait Edge[N]
trait Equals
class Object
trait Matchable
class Any
Show all
Known subtypes
class LUnDiEdge[N, L]
class LUnDiEdge[N, L]
class WUnDiEdge[N]
class WUnDiEdge[N]
class UnDiEdge[N]
class AbstractUnDiEdge[N]
Show all
object AnyUnDiEdge

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
case object Bag extends CollectionKind

Marks a hyperedge, $ORDIHYPER, to handle the endpoints as an unordered collection of nodes with duplicates allowed.

Marks a hyperedge, $ORDIHYPER, to handle the endpoints as an unordered collection of nodes with duplicates allowed.

Attributes

Supertypes
trait Singleton
trait Product
trait Mirror
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
Self type
Bag.type
sealed abstract class CollectionKind(val duplicatesAllowed: Boolean, val orderSignificant: Boolean)

Defines how to handle the ends of hyperedges, or the source/target ends of directed hyperedges, with respect to equality.

Defines how to handle the ends of hyperedges, or the source/target ends of directed hyperedges, with respect to equality.

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
object Bag.type
object Sequence.type

Attributes

Companion
class
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class DiEdge[N]
class LDiEdge[N, L]
class LDiEdge[N, L]
class WDiEdge[N]
class WDiEdge[N]
Show all
Self type

The abstract methods of this trait must be implemented by companion objects of directed, non-labeled hyperedges.

The abstract methods of this trait must be implemented by companion objects of directed, non-labeled hyperedges.

Attributes

Supertypes
trait Serializable
class Object
trait Matchable
class Any
Known subtypes
object DiHyperEdge.type
object DiHyperEdge.type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class DiHyperEdge[N]
class DiHyperEdge[N]
Show all
Self type
sealed trait Edge[+N] extends Equals

Base template for all edges in a Graph.

Base template for all edges in a Graph.

Library-provided edges are immutable for both mutable and immutable Graph. However, when using mutable graphs with labeled edges where labels are mutable with respect to your use case, you might want to make your label mutable accordingly. Otherwise a much less efficient edge replacement would be necessary.

Type parameters

N

the type of the nodes (ends) of this edge.

Attributes

Companion
object
Supertypes
trait Equals
class Object
trait Matchable
class Any
Known subtypes
trait AnyEdge[N]
trait AnyDiEdge[N]
class LDiEdge[N, L]
class LDiEdge[N, L]
class AbstractDiEdge[N]
trait AbstractGenericDiEdge[N, CC]
class WDiEdge[N]
class WDiEdge[N]
class DiEdge[N]
trait AnyUnDiEdge[N]
class LUnDiEdge[N, L]
class LUnDiEdge[N, L]
class WUnDiEdge[N]
class WUnDiEdge[N]
class UnDiEdge[N]
class AbstractUnDiEdge[N]
trait AnyHyperEdge[N]
class HyperEdge[N]
class HyperEdge[N]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
trait AnyDiHyperEdge[N]
class DiHyperEdge[N]
class DiHyperEdge[N]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
Show all
object Edge

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
Edge.type
trait EdgeCompanion[+E <: (Edge)] extends EdgeCompanionBase

Template for companion objects of generic edges.

Template for companion objects of generic edges.

Attributes

Supertypes
trait Serializable
class Object
trait Matchable
class Any
Known subtypes
object DiEdge.type
object UnDiEdge.type
sealed trait EdgeCompanionBase extends Serializable

Marker trait for companion objects of any non-labeled edge.

Marker trait for companion objects of any non-labeled edge.

Attributes

Supertypes
trait Serializable
class Object
trait Matchable
class Any
Known subtypes
object DiHyperEdge.type
object DiHyperEdge.type
trait EdgeCompanion[E]
object DiEdge.type
object UnDiEdge.type
object HyperEdge.type
object HyperEdge.type
Show all

Attributes

Supertypes
trait MultiEdge
class Object
trait Matchable
class Any
Known subtypes
class LDiEdge[N, L]
class LUnDiEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
Show all
Self type
Edge[_] & SingleLabel[_]

Attributes

Supertypes
trait MultiEdge
class Object
trait Matchable
class Any
Known subtypes
class WDiEdge[N]
class WUnDiEdge[N]
Self type
Edge[_]
sealed trait Factory[+CC <: ([N, E <: Edge[N]] =>> AnyGraph[N, E] & GraphLike[N, E, CC])]

Methods common to Graph companion objects in the core module.

Methods common to Graph companion objects in the core module.

Type parameters

CC

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

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait ImmutableFactory[CC]
object DefaultGraphImpl.type
object Graph.type
trait MutableFactory[CC]
object DefaultGraphImpl.type
object Graph.type
trait TypedGraphFactory[N, E, CC]
trait TypedGraphCoreFactory[N, E, CC]
trait TypedGraphFactory[N, E]
trait TypedGraphFactory[N, E]
Show all
trait GenericDiHyperEdgeMapper[+CC <: (Edge)]

Mixin for directed generic hyperedges to facilitate Graph mapping by def map(fNode).

Mixin for directed generic hyperedges to facilitate Graph mapping by def map(fNode).

Type parameters

CC

type constructor of the final edge class.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
Self type
trait GenericEdgeMapper[+CC <: (Edge)]

Mixin for directed and undirected generic edges to facilitate Graph mapping by def map(fNode).

Mixin for directed and undirected generic edges to facilitate Graph mapping by def map(fNode).

Type parameters

CC

type constructor of the final edge class.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait AbstractGenericDiEdge[N, CC]
class WDiEdge[N]
class WDiEdge[N]
class WUnDiEdge[N]
class WUnDiEdge[N]
class DiEdge[N]
class UnDiEdge[N]
Show all
Self type
AnyEdge[_]
trait GenericGraphCoreFactory[+CC <: ([N, E <: Edge[N]] =>> AnyGraph[N, E] & GraphLike[N, E, CC])] extends GenericGraphFactory[CC]

Attributes

Supertypes
trait Factory[CC]
class Object
trait Matchable
class Any
Known subtypes
trait ImmutableFactory[CC]
object DefaultGraphImpl.type
object Graph.type
trait MutableFactory[CC]
object DefaultGraphImpl.type
object Graph.type
Show all
trait GenericGraphFactory[+CC <: ([N, E <: Edge[N]] =>> AnyGraph[N, E] & GraphLike[N, E, CC])] extends Factory[CC]

Attributes

Supertypes
trait Factory[CC]
class Object
trait Matchable
class Any
Known subtypes
trait ImmutableFactory[CC]
object DefaultGraphImpl.type
object Graph.type
trait MutableFactory[CC]
object DefaultGraphImpl.type
object Graph.type
Show all
trait GenericHyperEdgeMapper[+CC <: (Edge)]

Mixin for undirected generic hyperedges to facilitate Graph mapping by def map(fNode).

Mixin for undirected generic hyperedges to facilitate Graph mapping by def map(fNode).

Type parameters

CC

type constructor of the final edge class.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
Self type

Specialized GenericDiHyperEdgeMapper that implements def map in terms of def copy.

Specialized GenericDiHyperEdgeMapper that implements def map in terms of def copy.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
Self type
trait GenericUnlabeledEdgeMapper[+CC <: (Edge)] extends GenericEdgeMapper[CC]

Specialized GenericEdgeMapper that implements def map in terms of def copy.

Specialized GenericEdgeMapper that implements def map in terms of def copy.

Attributes

Supertypes
trait GenericEdgeMapper[CC]
class Object
trait Matchable
class Any
Known subtypes
Self type
AnyEdge[_]

Specialized GenericHyperEdgeMapper that implements def map in terms of def copy.

Specialized GenericHyperEdgeMapper that implements def map in terms of def copy.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class HyperEdge[N]
class HyperEdge[N]
Self type

The abstract methods of this trait must be implemented by companion objects of non-labeled hyperedges.

The abstract methods of this trait must be implemented by companion objects of non-labeled hyperedges.

Attributes

Supertypes
trait Serializable
class Object
trait Matchable
class Any
Known subtypes
object HyperEdge.type
object HyperEdge.type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class HyperEdge[N]
class HyperEdge[N]
Show all
Self type
trait ImmutableFactory[+CC <: ([N, E <: Edge[N]] =>> Graph[N, E] & GraphLike[N, E, CC])] extends GenericGraphCoreFactory[CC]

Attributes

Supertypes
trait Factory[CC]
class Object
trait Matchable
class Any
Show all
Known subtypes
object DefaultGraphImpl.type
object Graph.type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LDiEdge[N, L]
class LDiEdge[N, L]
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LDiHyperEdge[N, L]
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
class LHyperEdge[N, L]
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LUnDiEdge[N, L]
class LUnDiEdge[N, L]
Self type
trait MultiEdge

Edge mixin for multigraph support.

Edge mixin for multigraph support.

As a default, hashCode/equality of edges is determined by their ends. We say that edge ends are part of the edge key.

Whenever your custom edge needs to be a multi-edge, meaning that your graph is allowed to connect some nodes by an instance of this edge even if those nodes are already connected, the edge key needs be extended by adding at least one more class member, constant or whatsoever to the edge key.

For example edges representing flight connections between airports need be multi-edges to allow for different flights between the same airports.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LDiEdge[N, L]
class LUnDiEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
class WDiEdge[N]
class WUnDiEdge[N]
Show all
Self type
Edge[_]

Mix in this trait in your labeled edge class if you want to indicate in its toString representation that the edge supports multigraphs. Once mixed in, the labelSeparator gets :++.

Mix in this trait in your labeled edge class if you want to indicate in its toString representation that the edge supports multigraphs. Once mixed in, the labelSeparator gets :++.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LDiEdge[N, L]
class LUnDiEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
Show all
Self type
LEdgeToString & MultiEdge

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class WDiEdge[N]
class WUnDiEdge[N]
Self type
WEdgeToString & MultiEdge
trait MutableFactory[+CC <: ([N, E <: Edge[N]] =>> Graph[N, E] & GraphLike[N, E, CC])] extends GenericGraphCoreFactory[CC]

Attributes

Supertypes
trait Factory[CC]
class Object
trait Matchable
class Any
Show all
Known subtypes
object DefaultGraphImpl.type
object Graph.type
trait PartialDiHyperEdgeMapper[+CC <: Edge[_]] extends PartialMapper

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type
trait PartialEdgeMapper[+CC <: Edge[_]] extends PartialMapper

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type
AnyEdge[_]
trait PartialHyperEdgeMapper[+CC <: Edge[_]] extends PartialMapper

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
case object Sequence extends CollectionKind

Marks a hyperedge, $ORDIHYPER, to handle the endpoints as an ordered collection of nodes with duplicates allowed.

Marks a hyperedge, $ORDIHYPER, to handle the endpoints as an ordered collection of nodes with duplicates allowed.

Attributes

Supertypes
trait Singleton
trait Product
trait Mirror
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
Self type
Sequence.type
trait SingleLabel[L]

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class LDiEdge[N, L]
class LUnDiEdge[N, L]
class LDiEdge[N, L]
class LUnDiEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
class LDiHyperEdge[N, L]
class LHyperEdge[N, L]
Show all
Self type
Edge[_] & LEdgeToString
object SingleLabel

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
trait TypedGraphCoreFactory[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, CC])] extends TypedGraphFactory[N, E, CC]

Attributes

Supertypes
trait TypedGraphFactory[N, E, CC]
trait Factory[CC]
class Object
trait Matchable
class Any
Known subtypes
trait TypedGraphFactory[N, E]
trait TypedGraphFactory[N, E]
trait TypedGraphFactory[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, CC])] extends Factory[CC]

Attributes

Supertypes
trait Factory[CC]
class Object
trait Matchable
class Any
Known subtypes
trait TypedGraphCoreFactory[N, E, CC]
trait TypedGraphFactory[N, E]
trait TypedGraphFactory[N, E]

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class UnDiEdge[N]
class LUnDiEdge[N, L]
class LUnDiEdge[N, L]
class WUnDiEdge[N]
class WUnDiEdge[N]
Show all
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any

Attributes

Supertypes
class Object
trait Matchable
class Any

Attributes

Supertypes
class Object
trait Matchable
class Any

Attributes

Supertypes
class Object
trait Matchable
class Any
trait UnapplyLabel[N, L]

Attributes

Supertypes
class Object
trait Matchable
class Any
trait UnapplyLabeledEdge[N, E <: Edge[N], L]

Attributes

Supertypes
class Object
trait Matchable
class Any

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class WDiEdge[N]
class WDiEdge[N]
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Self type

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class WUnDiEdge[N]
class WUnDiEdge[N]
Self type