---
title: "Graphs and traversals"
description: "How can you traverse reachable graph nodes without repeated processing?"
status: "coming-soon"
language: "en"
canonical: "https://bulnik.dev/en/articles/topics/T54.05/"
topicId: "T54.05"
---

> Coming soon — this article is being prepared. Below are its question, intended outcome, and place in the story.

## The question

How can you traverse reachable graph nodes without repeated processing?

## What we will work through

Traverse reachable graph nodes without repeated processing.

## Before you begin

Previously covered: Measuring asymptotic complexity.

- [Measuring asymptotic complexity](/en/articles/topics/T54.01/)