Class DFSTraversal<V>

java.lang.Object

org.episteme.core.mathematics.discrete.graph.DFSTraversal<V>

All Implemented Interfaces:

GraphTraversalStrategy<V>

public class DFSTraversal<V>
extends Object
implements GraphTraversalStrategy<V>

Depth-First Search (DFS) traversal strategy.

Explores as far as possible along each branch before backtracking. Uses CPU-based recursive implementation.

Since:

1.0

Author:

Silvere Martin-Michiellot, Gemini AI (Google DeepMind)

Constructor Summary

Constructors

Constructor	Description
DFSTraversal()

Method Summary

Modifier and Type	Method	Description
void	traverse(Graph<V> graph, V start, VertexVisitor<V> visitor)	Traverses the graph starting from the given vertex.

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface GraphTraversalStrategy

traverse

Constructor Details

DFSTraversal

public DFSTraversal()

Method Details

traverse

public void traverse(Graph<V> graph,
 V start,
 VertexVisitor<V> visitor)

Description copied from interface: GraphTraversalStrategy

Traverses the graph starting from the given vertex.

The implementation chooses the appropriate backend automatically (CPU or GPU) based on graph size and backend availability.

Specified by:

traverse in interface GraphTraversalStrategy<V>

Parameters:

graph - the graph to traverse

start - the starting vertex

visitor - the visitor to call for each vertex