---
name: "Graph::Traversal::DFS"
section: "3pm"
platform: "linux"
package: "libgraph-perl"
version: "1:0.9735-1"
release: "Debian 13 (Trixie)"
platforms: ["linux"]
url: "https://new.carta.tech/Graph::Traversal::DFS"
---

# Graph::Traversal::DFS(3pm)

depth-first traversal of graphs

## NAME

Graph::Traversal::DFS - depth-first traversal of graphs

## SYNOPSIS

```
    use Graph;
    my $g = Graph->new;
    $g->add_edge(...);
    use Graph::Traversal::DFS;
    my $d = Graph::Traversal::DFS->new($g, %opt);
    $d->dfs; # Do the traversal.
```

## DESCRIPTION

With this class one can traverse a Graph in depth-first order.

The callback parameters `%opt` are explained in Graph::Traversal.

### Methods

The following methods are available:

- dfs

  Traverse the graph in depth-first order.  Returns all vertices traversed in post-order.

## SEE ALSO

Graph::Traversal, Graph::Traversal::BFS, Graph.