Represents a directed edge (arc / arrow) connecting two nodes.
Represents a directed edge (link) in a hypergraph with unlimited number of nodes.
Template trait for directed edges.
The abstract methods of this trait must be implemented by companion objects of simple (non-weighted, non-labeled) edges.
Marker trait for companion objects of any kind of edge.
This trait is to be mixed in by every class implementing EdgeLike.
Template for Edges in a Graph.
This trait supports extending the default key of an edge with additional attributes.
Represents an undirected hyperedge (hyperlink) in a hypergraph with unlimited number of nodes.
The abstract methods of this trait must be implemented by companion objects of simple (non-weighted, non-labeled) hyperedges.
Represents an undirected edge.
Factory for directed edges.
Factory for directed hyper-edges.
Factory for undirected hyper-edges.
Helper object to convert edge-factory parameter-lists to tuple-n or list.
Factory for undirected edges.
$SHORTCUT edge match {case n1 ~ n2 => f(n1, n2)}
.
$SHORTCUT edge match {case source ~> target => f(source, target)}
.
$SHORTCUT hyperedge match {case n1 ~~ (n2, n3) => f(n1, n2, n3)}
.
$SHORTCUT diHyperedge match {case source ~~ (t1, t2) => f(source, t1, t2)}
.
This object serves as a container for all edge-types to be used in the context of
Graph
. You will usually simply import all its members along with the members of GraphParam:import scalax.collection.GraphPredef._, scalax.collection.GraphEdge,_