Same as addWLEdge(node_1, node_2, nodes)(weight, label)
except for the returned result.
Same as addWLEdge(node_1, node_2, nodes)(weight, label)
except for the returned result.
This mutable graph containing the hyperedge that has been created or found.
to be created equals
to an already existing hyperedge.
Same as addWLEdge(node_1, node_2)(weight, label)
except for the returned result.
Same as addWLEdge(node_1, node_2)(weight, label)
except for the returned result.
This mutable graph containing the edge that has been created or found.
Same as addWEdge(node_1, node_2, nodes)(weight)
except for the returned result.
Same as addWEdge(node_1, node_2, nodes)(weight)
except for the returned result.
This mutable graph containing the hyperedge that has been created or found.
to be created equals
to an already existing hyperedge.
Same as addWEdge(node_1, node_2)(weight)
except for the returned result.
Same as addWEdge(node_1, node_2)(weight)
except for the returned result.
This mutable graph containing the edge that has been created or found.
Same as addLEdge(node_1, node_2, nodes)(label)
except for the returned result.
Same as addLEdge(node_1, node_2, nodes)(label)
except for the returned result.
This mutable graph containing the hyperedge that has been created or found.
to be created equals
to an already existing hyperedge.
Same as addLEdge(node_1, node_2)(label)
except for the returned result.
Same as addLEdge(node_1, node_2)(label)
except for the returned result.
This mutable graph containing the edge that has been created or found.
Same as addEdge(node_1, node_2, nodes)
except for the returned result.
Same as addEdge(node_1, node_2, nodes)
except for the returned result.
This mutable graph containing the hyperedge that has been created or found.
to be created equals
to an already existing hyperedge.
Same as addEdge(node_1, node_2)
except for the returned result.
Same as addEdge(node_1, node_2)
except for the returned result.
This mutable graph containing the edge that has been created or found.
Same as addEdge(node_1, node_2, nodes)
except for the returned result.
Same as addEdge(node_1, node_2, nodes)
except for the returned result.
The new hyperedge or the corresponding contained hyperedge if the hyperedge
to be created equals
to an already existing hyperedge.
Same as addEdge(node_1, node_2)
except for the returned result.
Same as addEdge(node_1, node_2)
except for the returned result.
The new edge or the corresponding contained edge if the edge
to be created equals
to an already existing edge.
Same as addLEdge(node_1, node_2, nodes)(label)
except for the returned result.
Same as addLEdge(node_1, node_2, nodes)(label)
except for the returned result.
The new hyperedge or the corresponding contained hyperedge if the hyperedge
to be created equals
to an already existing hyperedge.
Same as addLEdge(node_1, node_2)(label)
except for the returned result.
Same as addLEdge(node_1, node_2)(label)
except for the returned result.
The new edge or the corresponding contained edge if the edge
to be created equals
to an already existing edge.
Same as addWEdge(node_1, node_2, nodes)(weight)
except for the returned result.
Same as addWEdge(node_1, node_2, nodes)(weight)
except for the returned result.
The new hyperedge or the corresponding contained hyperedge if the hyperedge
to be created equals
to an already existing hyperedge.
Same as addWEdge(node_1, node_2)(weight)
except for the returned result.
Same as addWEdge(node_1, node_2)(weight)
except for the returned result.
The new edge or the corresponding contained edge if the edge
to be created equals
to an already existing edge.
Same as addWLEdge(node_1, node_2, nodes)(weight, label)
except for the returned result.
Same as addWLEdge(node_1, node_2, nodes)(weight, label)
except for the returned result.
The new hyperedge or the corresponding contained hyperedge if the hyperedge
to be created equals
to an already existing hyperedge.
Same as addWLEdge(node_1, node_2)(weight, label)
except for the returned result.
Same as addWLEdge(node_1, node_2)(weight, label)
except for the returned result.
The new edge or the corresponding contained edge if the edge
to be created equals
to an already existing edge.
Creates a new inner hyperedge between node_1
, node_2
and nodes
using edgeFactory
and adds it to the edge set of this graph.
Creates a new inner hyperedge between node_1
, node_2
and nodes
using edgeFactory
and adds it to the edge set of this graph.
Node arguments not yet contained in this graph will be added to the node set.
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
An edge companion who's from
is to serve as the edge factory.
true
if a new hyperedge has been created. false
if no new hyperedge could be
created because there exists a corresponding equaling hyperedge.
Creates a new inner edge between node_1
and node_2
using edgeFactory
and adds it to the edge set of this graph.
Creates a new inner edge between node_1
and node_2
using edgeFactory
and adds it to the edge set of this graph.
Node arguments not yet contained in this graph will be added to the node set.
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
An edge companion who's from
is to serve as the edge factory.
true
if a new edge has been created. false
if no new edge could be
created because there exists a corresponding equaling edge.
Creates a new weighted and labeled inner hyperedge between node_1
, node_2
and nodes
using edgeFactory
and adds it to the edge set of this graph.
Creates a new weighted and labeled inner hyperedge between node_1
, node_2
and nodes
using edgeFactory
and adds it to the edge set of this graph.
Node arguments not yet contained in this graph will be added to the node set.
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
The value the labeled edge to be created should have as its label.
An edge companion who's from
is to serve as the edge factory.
true
if a new hyperedge has been created. false
if no new hyperedge could be
created because there exists a corresponding equaling hyperedge.
Creates a new labeled inner edge between node_1
and node_2
using edgeFactory
and adds it to the edge set of this graph.
Creates a new labeled inner edge between node_1
and node_2
using edgeFactory
and adds it to the edge set of this graph.
Node arguments not yet contained in this graph will be added to the node set.
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
The value the labeled edge to be created should have as its label.
An edge companion who's from
is to serve as the edge factory.
true
if a new edge has been created. false
if no new edge could be
created because there exists a corresponding equaling edge.
Creates a new weighted inner hyperedge between node_1
, node_2
and nodes
using edgeFactory
and adds it to the edge set of this graph.
Creates a new weighted inner hyperedge between node_1
, node_2
and nodes
using edgeFactory
and adds it to the edge set of this graph.
Node arguments not yet contained in this graph will be added to the node set.
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
The number the weighted edge to be created should have as its weight.
An edge companion who's from
is to serve as the edge factory.
true
if a new hyperedge has been created. false
if no new hyperedge could be
created because there exists a corresponding equaling hyperedge.
Creates a new weighted inner edge between node_1
and node_2
using edgeFactory
and adds it to the edge set of this graph.
Creates a new weighted inner edge between node_1
and node_2
using edgeFactory
and adds it to the edge set of this graph.
Node arguments not yet contained in this graph will be added to the node set.
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
The number the weighted edge to be created should have as its weight.
An edge companion who's from
is to serve as the edge factory.
true
if a new edge has been created. false
if no new edge could be
created because there exists a corresponding equaling edge.
Creates a new weighted and labeled inner hyperedge between node_1
, node_2
and nodes
using edgeFactory
and adds it to the edge set of this graph.
Creates a new weighted and labeled inner hyperedge between node_1
, node_2
and nodes
using edgeFactory
and adds it to the edge set of this graph.
Node arguments not yet contained in this graph will be added to the node set.
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
The number the weighted edge to be created should have as its weight.
The value the labeled edge to be created should have as its label.
An edge companion who's from
is to serve as the edge factory.
true
if a new hyperedge has been created. false
if no new hyperedge could be
created because there exists a corresponding equaling hyperedge.
Creates a new weighted and labeled inner edge between node_1
and node_2
using edgeFactory
and adds it to the edge set of this graph.
Creates a new weighted and labeled inner edge between node_1
and node_2
using edgeFactory
and adds it to the edge set of this graph.
Node arguments not yet contained in this graph will be added to the node set.
The first outer node to be incident with the edge to be created. In case of a directed edge, this becomes the source.
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
The number the weighted edge to be created should have as its weight.
The value the labeled edge to be created should have as its label.
An edge companion who's from
is to serve as the edge factory.
true
if a new edge has been created. false
if no new edge could be
created because there exists a corresponding equaling edge.
Creates a new custom inner hyperedge without modifying the node or edge set .
Creates a new custom inner hyperedge without modifying the node or edge set .
Creates a new custom inner edge without modifying the node or edge set .
Creates a new custom inner edge without modifying the node or edge set .
Creates a new simple inner edge without modifying the node or edge set .
Creates a new simple inner edge without modifying the node or edge set .
Creates a new simple inner hyperedge without modifying the node or edge set .
Creates a new simple inner hyperedge without modifying the node or edge set .
Creates a new labeled inner edge without modifying the node or edge set .
Creates a new labeled inner edge without modifying the node or edge set .
Creates a new labeled inner hyperedge without modifying the node or edge set .
Creates a new labeled inner hyperedge without modifying the node or edge set .
Creates a new weighted inner edge without modifying the node or edge set .
Creates a new weighted inner edge without modifying the node or edge set .
Creates a new weighted inner hyperedge without modifying the node or edge set .
Creates a new weighted inner hyperedge without modifying the node or edge set .
Creates a new weighted and labeled inner edge without modifying the node or edge set .
Creates a new weighted and labeled inner edge without modifying the node or edge set .
Creates a new weighted and labeled inner hyperedge without modifying the node or edge set .
Creates a new weighted and labeled inner hyperedge without modifying the node or edge set .
This trait contains mutating edge addition methods that don't require an outer edge. These methods are kept separately from
mutable.GraphLike
solely for convenience.