Packages

package generic

Content Hierarchy
Ordering
  1. Alphabetic
Visibility
  1. Public
  2. Protected

Type Members

  1. abstract class AbstractDiEdge[+N] extends AnyDiEdge[N]
  2. trait AbstractDiEdgeImplicits[N, E[N] <: AnyDiEdge[N], C <: EdgeCompanion[E]] extends Any
  3. abstract class AbstractDiHyperEdge[+N] extends AnyDiHyperEdge[N]
  4. trait AbstractEdgeImplicits[N, E[X] <: Edge[X] with AnyEdge[X], C <: EdgeCompanion[E]] extends Any
  5. trait AbstractGenericDiEdge[+N, +CC[X] <: AbstractGenericDiEdge[X, CC]] extends AnyDiEdge[N] with GenericEdgeMapper[CC]
  6. abstract class AbstractGenericDiHyperEdge[+N, +CC[X] <: AbstractGenericDiHyperEdge[X, CC]] extends AbstractDiHyperEdge[N] with GenericDiHyperEdgeMapper[CC]
  7. abstract class AbstractGenericHyperEdge[+N, +CC[X] <: AbstractGenericHyperEdge[X, CC]] extends AbstractHyperEdge[N] with GenericHyperEdgeMapper[CC]
  8. trait AbstractGenericUnDiEdge[+N, +CC[X] <: AbstractGenericUnDiEdge[X, CC]] extends AnyUnDiEdge[N] with GenericEdgeMapper[CC]
  9. abstract class AbstractHyperEdge[+N] extends AnyHyperEdge[N]
  10. abstract class AbstractUnDiEdge[+N] extends AnyUnDiEdge[N]
  11. trait AnyDiEdge[+N] extends AnyDiHyperEdge[N] with AnyEdge[N] with EqDi[N]
  12. trait AnyDiHyperEdge[+N] extends AnyHyperEdge[N] with EqDiHyper
  13. trait AnyEdge[+N] extends Edge[N]
  14. trait AnyHyperEdge[+N] extends Edge[N] with EqHyper
  15. 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. Used to predictably order elements when computing Graph.toString.

  16. trait AnyUnDiEdge[+N] extends AnyHyperEdge[N] with AnyEdge[N] with EqUnDi[N]
  17. sealed abstract class CollectionKind extends AnyRef

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

  18. trait DefaultConfig[+CC[N, E <: Edge[N]] <: AnyGraph[N, E] with GraphLike[N, E, CC]] extends AnyRef
    Attributes
    protected
  19. trait DiEdgeToString extends EdgeToString
  20. trait DiHyperEdgeCompanion[+E[N] <: AbstractDiHyperEdge[N]] extends EdgeCompanionBase

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

  21. sealed trait DiHyperEdgeMapper extends Mapper
    Attributes
    protected[collection]
  22. trait DiHyperEdgeToString extends EdgeToString
  23. 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.

    N

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

  24. trait EdgeCompanion[+E[N] <: Edge[N]] extends EdgeCompanionBase

    Template for companion objects of generic edges.

  25. sealed trait EdgeCompanionBase extends Serializable

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

  26. sealed trait EdgeMapper extends Mapper
    Attributes
    protected[collection]
  27. sealed trait EdgeToString extends AnyRef
    Attributes
    protected
  28. sealed trait Eq extends AnyRef
    Attributes
    protected[collection]
  29. trait EqDi[+N] extends Eq
    Attributes
    protected[collection]
  30. trait EqDiHyper extends Eq

    Equality for targets handled as a $BAG.

    Equality for targets handled as a $BAG. Targets are equal if they contain the same nodes irrespective of their position.

    Attributes
    protected[collection]
  31. trait EqHyper extends Eq
    Attributes
    protected[collection]
  32. trait EqUnDi[+N] extends Eq
    Attributes
    protected[collection]
  33. trait ExtendedKeyBySingleLabel extends MultiEdge
  34. trait ExtendedKeyByWeight extends MultiEdge
  35. sealed trait Factory[+CC[N, E <: Edge[N]] <: AnyGraph[N, E] with GraphLike[N, E, 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.

  36. trait GenericDiHyperEdgeMapper[+CC[X] <: Edge[X]] extends GenericMapper with DiHyperEdgeMapper
  37. trait GenericEdgeMapper[+CC[X] <: Edge[X]] extends GenericMapper with EdgeMapper

    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).

    CC

    type constructor of the final edge class.

  38. trait GenericGraphCoreFactory[+CC[N, E <: Edge[N]] <: AnyGraph[N, E] with GraphLike[N, E, CC]] extends GenericGraphFactory[CC] with DefaultConfig[CC]
  39. trait GenericGraphFactory[+CC[N, E <: Edge[N]] <: AnyGraph[N, E] with GraphLike[N, E, CC]] extends Factory[CC]
  40. trait GenericHyperEdgeMapper[+CC[X] <: Edge[X]] extends GenericMapper with HyperEdgeMapper
  41. sealed trait GenericMapper extends Mapper
    Attributes
    protected[collection]
  42. trait HyperEdgeCompanion[+E[N] <: AbstractHyperEdge[N]] extends EdgeCompanionBase

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

  43. sealed trait HyperEdgeMapper extends Mapper
    Attributes
    protected[collection]
  44. trait HyperEdgeToString extends EdgeToString
  45. trait ImmutableFactory[+CC[N, E <: Edge[N]] <: Graph[N, E] with GraphLike[N, E, CC]] extends GenericGraphCoreFactory[CC]
  46. trait LDiEdgeToString extends LEdgeToString with DiEdgeToString
  47. trait LDiHyperEdgeToString extends LEdgeToString with DiHyperEdgeToString
  48. sealed trait LEdgeToString extends EdgeToString
    Attributes
    protected
  49. trait LHyperEdgeToString extends LEdgeToString with HyperEdgeToString
  50. trait LUnDiEdgeToString extends LEdgeToString with UnDiEdgeToString
  51. sealed trait Mapper extends AnyRef
    Attributes
    protected[collection]
  52. trait MultiEdge extends AnyRef

    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.

  53. trait MultiLEdgeToString extends AnyRef

    Mix in this trait in your labeled edge class if you want to indicate in its toString representation that the edge supports multigraphs.

    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 :++.

  54. trait MultiWEdgeToString extends AnyRef
  55. trait MutableFactory[+CC[N, E <: Edge[N]] <: Graph[N, E] with mutable.GraphLike[N, E, CC]] extends GenericGraphCoreFactory[CC]
  56. trait OrderedEndpoints extends AnyRef

    Marks (directed) hyperedge endpoints to have a significant order.

    Marks (directed) hyperedge endpoints to have a significant order.

    Attributes
    protected[collection]
  57. trait PartialDiHyperEdgeMapper[+CC <: Edge[_]] extends PartialMapper with DiHyperEdgeMapper
  58. trait PartialEdgeMapper[+CC <: Edge[_]] extends PartialMapper with EdgeMapper
  59. trait PartialHyperEdgeMapper[+CC <: Edge[_]] extends PartialMapper with HyperEdgeMapper
  60. trait PartialMapper extends Mapper
  61. trait SingleLabel[L] extends AnyRef
  62. trait TypedGraphCoreFactory[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, CC]] extends TypedGraphFactory[N, E, CC] with DefaultConfig[CC]
  63. trait TypedGraphFactory[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, CC]] extends Factory[CC]
  64. trait UnDiEdgeToString extends EdgeToString
  65. trait UnapplyGenericHyperLabel[L] extends AnyRef
  66. trait UnapplyGenericLabel[L] extends AnyRef
  67. trait UnapplyGenericLabeledDiHyperEdge[E[X] <: AbstractDiHyperEdge[X], L] extends AnyRef
  68. trait UnapplyGenericLabeledEdge[E[X] <: AnyEdge[X], L] extends AnyRef
  69. trait UnapplyLabel[N, L] extends AnyRef
  70. trait UnapplyLabeledEdge[N, E <: Edge[N], L] extends AnyRef
  71. trait WDiEdgeToString extends WEdgeToString with DiEdgeToString
  72. trait WDiHyperEdgeToString extends WEdgeToString with DiHyperEdgeToString
  73. sealed trait WEdgeToString extends LEdgeToString
    Attributes
    protected
  74. trait WHyperEdgeToString extends WEdgeToString with HyperEdgeToString
  75. trait WUnDiEdgeToString extends WEdgeToString with UnDiEdgeToString

Value Members

  1. case object % extends Product with Serializable

    Intermediate infix extractor for the "unlabeled part" of a weighted edge.

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

  2. object AbstractDiHyperEdge
  3. object AbstractDiHyperEdgeImplicits
  4. object AbstractHyperEdge
  5. object AbstractHyperEdgeImplicits
  6. object AnyDiHyperEdge
  7. object AnyEdge
  8. object AnyHyperEdge
  9. object AnyUnDiEdge
  10. case object Bag extends CollectionKind with Product with Serializable

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

  11. object CollectionKind
  12. object Edge
  13. object Eq
    Attributes
    protected[collection]
  14. case object Sequence extends CollectionKind with Product with Serializable

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

  15. object SingleLabel

Ungrouped