Choose your tool

DATA TOOL

Graph BFS and DFS Traversal

Visit reachable nodes from a selected source using breadth-first or depth-first order.

◇ Browser only

Your text

Or load a UTF-8 text file

0 lines · 0 characters

ResultsReady when you are

Your results will appear here.

Copy or download your result below.

Your text stays on this device.

LESS BUSYWORK, MORE DONE

Three steps. That’s it.

A useful toolkit for text, data, images and calculations.

01
Add your input
Choose a tool, enter values or select a file.
02
Make it yours
Adjust the options and run the action.
03
Take the result
Copy the result or download its file.

Breadth first search traversal online

Visit reachable nodes from a selected source using breadth-first or depth-first order. Use this when inspecting structured input or preparing a data or code artifact. Generated commands and configurations remain text until you review and use them yourself.

How to use it

Paste JSON matching the structure in the example. Set starting node, traversal. Choose Run tool. Review the output, then copy or download it.

Options and example settings

Option	Choices / value	Example default
Starting node	Enter starting node.	A
Traversal	breadth / depth	breadth

Worked examples

Use this when inspecting structured input or preparing a data or code artifact. Generated commands and configurations remain text until you review and use them yourself.

Reproducible worked example

Settings: Starting node: A; Traversal: breadth

Input:

[["A","B",2],["A","C",5],["B","C",1]]

With the input and settings above, the tool produces:

Output:

{
  "order": [
    "A",
    "B",
    "C"
  ],
  "unreachable": []
}

The example returns an object with 2 top-level fields. The fields “order”, “unreachable” identify the returned values or sections.

Limitations and common mistakes

Bounded graph algorithms: 100 named nodes and 1,000 input edges. Inputs are directed unless the tool explicitly treats edges as undirected. Isolated nodes require a self-edge to be represented.
Combined input is bounded to 150,000 characters; output text is bounded to 1.2 million characters. Some algorithms impose smaller limits, stated in their error messages.

Frequently asked questions

What format should I enter?

Paste JSON matching the structure in the example. The worked example shows the supported structure and actual output.

How can I traverse a graph with BFS or DFS online?

Paste JSON matching the structure in the example. Set starting node, traversal. Choose Run tool. Review the output, then copy or download it.

Where is my input processed?

The bundled tool processes input in your browser. It does not upload tool input to a conversion service. Other site plugins, analytics, advertising and browser extensions may have separate behavior.