Provides utility methods for creating and managing instances of the ProtoConnexions class, which represents a specific traversal of vertices within a graph resulting from a depth-first search starting at a particular vertex.
Creates a ProtoConnexions instance representing a traversal of a graph using depth-first search (DFS). The traversal starts from the specified vertex, processes each vertex using the provided function, and returns the resulting connexions.
Creates a ProtoConnexions instance representing a traversal of a graph using depth-first search (DFS). The traversal starts from the specified vertex, processes each vertex using the provided function, and returns the resulting connexions.
Type parameters
E
the type representing the edge attribute in the traversal.
V
the type representing a vertex in the graph.
Value parameters
graph
the graph-like structure to be traversed, of type core.Traversable[V].
start
the starting vertex for the DFS traversal, of type V.
Attributes
Returns
a ProtoConnexions object that encapsulates the result of the traversal, mapping vertices to their respective directed edges.