The properties controlling subsequent traversals.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

Set of all contained edges.

The node where subsequent graph traversals start.

The properties controlling subsequent traversals.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

The node where subsequent graph traversals start.

The properties controlling subsequent traversals.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

The node where subsequent graph traversals start.

The properties controlling subsequent traversals. A kind different from DepthFirst will be ignored.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

The node where subsequent graph traversals start.

The properties controlling subsequent traversals.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

The node this path starts at.

Expected maximum number of nodes on this path.

Determines the edge to be selected between neighbor nodes if an edge is not supplied explicitly. This is only relevant in case of multigraphs.

The node this walk starts at.

Expected maximum number of nodes on this walk.

Determines the edge to be selected between neighbor nodes if an edge is not supplied explicitly. This is only relevant in case of multigraphs.

Set of all contained nodes.

The node where subsequent graph traversals start.

The properties controlling subsequent traversals.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

The node where subsequent graph traversals start.

The properties controlling subsequent traversals.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

The node where subsequent graph traversals start.

The properties controlling subsequent traversals. A kind different from DepthFirst will be ignored.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

The node where subsequent graph traversals start.

The properties controlling subsequent traversals.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

The properties controlling subsequent traversals.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

true if this graph has not contained edge before.

true if this graph has not contained node before.

the edge to add.

the inner edge containing the added edge.

the node to add.

inner node containing the added node.

to be concatenated. Nodes that are implicitly defined by any edge in edges will be ignored.

to be concatenated.

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The higher kind of the generic edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.

To apply to all edges of this graph. This function is passed the current inner edge and its ends after being mapped by fNode. Since the inner edge is passed you can also examine its context. Call outer to get the outer edge of type E.

A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The higher kind of the generic edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node. If fNode returns several new nodes with none equaling to the original node, the first new node is accepted to be the result of the node transformation. For more flexibility pass your own edge mapper to the overload.

A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).

has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.

To apply to all edges of this graph. This function is passed the current inner edge and its ends after being mapped by fNode. Since the inner edge is passed you can also examine its context. Call outer to get the outer edge of type E.

A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node. If fNode returns several new nodes with none equaling to the original node, the first new node is accepted to be the result of the node transformation. For more flexibility pass your own edge mapper to the overload.

has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The higher kind of the generic edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.

To apply to all directed hyperedges in this graph. This function is passed the existing inner directed hyperedge and its sources and targets after being mapped by fNode. Since the inner directed hyperedge is passed you can also examine the edge context. Call outer to get the outer directed hyperedge of type E.

To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.

A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).

has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.

To apply to all directed hyperedges in this graph. This function is passed the existing inner directed hyperedge and its sources and targets after being mapped by fNode. Since the inner directed hyperedge is passed you can also examine the edge context. Call outer to get the outer directed hyperedge of type E.

To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.

A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).

has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The higher kind of the generic edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.

To apply to all hyperedges in this graph. This function is passed the current inner hyperedge and its ends after being mapped by fNode. Since the inner hyperedge is passed you can also examine its context. Call outer to get the outer hyperedge of type E.

To apply to any directed hyperedge in this possibly mixed graph. If not present directed hyperedges will be mapped by the mandatory fDiHyperEdge. You are recommended supplying Some unless you know that the graph does not contain any directed hyperedge.

To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.

A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).

has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.

To apply to all hyperedges in this graph. This function is passed the current inner hyperedge and its ends after being mapped by fNode. Since the inner hyperedge is passed you can also examine its context. Call outer to get the outer hyperedge of type E.

To apply to any directed hyperedge in this possibly mixed graph. If not present directed hyperedges will be mapped by the mandatory fDiHyperEdge. You are recommended supplying Some unless you know that the graph does not contain any directed hyperedge.

To apply to any directed or undirected edge in this possibly mixed graph. If not present simple edges will be mapped by the mandatory edge mapper you supply. You are recommended supplying Some unless you know that the graph does not contain any simple edge.

A new graph of possibly changed node and edge types and of any new structure depending on your edge mapper(s).

has a simplified signature in this overload leaving out the inner edge. This comes in handy whenever you don't need to inspect inner edges.

the result type of the binary operator.

the start value that is passed to opNode the first time.

the binary operator that is passed the cumulated value and an inner node.

the binary operator that is passed the cumulated value and an inner edge.

the cumulated value.

the binary operator that is passed the cumulated value and an outer node.

the binary operator that is passed the cumulated value and an outer edge.

The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.

The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.

true if this graph is complete, false if this graph contains any independent nodes.

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The higher kind of the generic edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.

To apply to all edges of this graph. This function is passed the current inner edge and its ends after being mapped by fNode. Since the inner edge is passed you can also examine its context. Call outer to get the outer edge of type E.

The mapped graph with possibly changed node and edge type parameters.

The node type of the resulting graph which may be unchanged or different from this graph's node type.

The higher kind of the generic edge type parameter of this graph.

To apply to all nodes of this graph. Since the inner node is passed you can also examine the node context. Call outer to get the value of type N of the node.

The mapped graph with possibly changed node and edge type parameters.