reasoning benchmark
Graphwalks BFS <128k
A graph reasoning benchmark that evaluates language models' ability to perform breadth-first search (BFS) operations on graphs with context length under 128k tokens, returning nodes reachable at specified depths.
Updated Aug 7, 2026
Published models11
Registry coverage11
MetricScore
EvidenceB
Graphwalks BFS <128k leaderboard
Sorted by the source-provided rank. Higher score is better according to the registry.
| 1 | OP | 94.0% | 100.0% | 22 | C | |
| 2 | OP | 93.0% | 95.2% | 22 | C | |
| 6 | OP | 78.3% | 76.2% | 22 | C | |
| 8 | OP | 76.3% | 66.7% | 22 | C | |
| 9 | OP | 73.4% | 61.9% | 22 | C | |
| 10 | OP | 72.3% | 57.1% | 22 | C | |
| 12 | OP | 61.7% | 47.6% | 22 | C | |
| 13 | OP | 61.7% | 42.9% | 22 | C | |
| 15 | OP | 51.0% | 33.3% | 22 | C | |
| 17 | OP | 41.7% | 23.8% | 22 | C | |
| 18 | OP | 25.0% | 19.1% | 22 | C |
Score distribution
Top published rows on the benchmark's original scale.
Graphwalks BFS <128k highlights
The top published results on this benchmark's own scale.
What is Graphwalks BFS <128k?
Definition and scoring fields from the benchmark registry.
A graph reasoning benchmark that evaluates language models' ability to perform breadth-first search (BFS) operations on graphs with context length under 128k tokens, returning nodes reachable at specified depths.
Scores are shown in ratio. The current registry marks this benchmark as not independently verified with evidence level B.
- Family
- Graphwalks BFS <128k
- Modality
- text
- Primary category
- reasoning
- Score direction
- higher
- LLMBoard eligible
- Yes
- Evaluation key
- graphwalks-bfs-<128k|llm-stats-current
Source-native results are preserved. Eligibility for the overall LLMBoard score is a separate policy decision.
FAQ
Common questions about Graphwalks BFS <128k.
Which model scores highest on Graphwalks BFS <128k?
GPT-5.2 is currently ranked first with 94.0%.
What does Graphwalks BFS <128k measure?
A graph reasoning benchmark that evaluates language models' ability to perform breadth-first search (BFS) operations on graphs with context length under 128k tokens, returning nodes reachable at specified depths.
Is a higher score better?
Yes. Higher values rank better for this benchmark.
How many models are compared?
11 unique published model results are currently shown.
Does this benchmark affect the overall score?
This benchmark is marked as eligible for the current LLMBoard capability methodology.