package labeled
Type Members
- type GenericDiHyperEdgeMapper[+CC[X] <: Edge[X]] = generic.GenericDiHyperEdgeMapper[CC]
- type GenericHyperEdgeMapper[+CC[X] <: Edge[X]] = generic.GenericHyperEdgeMapper[CC]
- abstract class LDiHyperEdge[+N, L] extends AbstractDiHyperEdge[N] with SingleLabel[L] with LDiHyperEdgeToString
Template for generic directed hyperedges with a single
label
field.Template for generic directed hyperedges with a single
label
field. Equality is based solely on theends
so this trait is not suitable for multigraphs. Mix inGenericDiHyperEdgeMapper
to get your derived hyperedge also mappable. - abstract class LDiHyperEdgeInfixConstructor[N, L, CC[X] <: AbstractDiHyperEdge[X] with SingleLabel[L]] extends AnyRef
Template for an
implicit class
that defines the infix constructor:+
to pass a label likeSeveral(1, 2) ~~> One(3) :+ aLabel
. - abstract class LHyperEdge[+N, L] extends AbstractHyperEdge[N] with SingleLabel[L] with LHyperEdgeToString
Template for generic undirected hyperedges with a single
label
field.Template for generic undirected hyperedges with a single
label
field. Equality is based solely on theends
so this trait is not suitable for multigraphs. Mix inGenericHyperedgeMapper
to get your derived hyperedge also mappable. - abstract class LHyperEdgeInfixConstructor[N, L, CC[X] <: AbstractHyperEdge[X] with SingleLabel[L]] extends AnyRef
Template for an
implicit class
that defines the infix constructor:+
to pass a label like1 ~~ 2 ~~ 3 :+ aLabel
.
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraph
immutable.Graph
and its inner nodesmutable.Graph
and its inner nodes.edges
package and its subpackageshyperedges
package and its subpackages.labeled edges
packagemultilabeled edges
packagelabeled hyperedges
packagemultilabeled hyperedges
packageordered labeled hyperedges
packageordered multilabeled hyperedges
objectgeneric
package.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.