Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

Should dfs be lazy?

Open
#918 8 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
30/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
haskell
Domain
data

Research direction

Start at the Data.Graph implementation and read the original paper's treatment of lazy ST. Compare the current strict ST behavior with ordered traversals that use unsafeInterleaveST, then establish whether laziness improves the relevant consumption patterns and document or validate the result with appropriate tests or benchmarks.

Written by the indexing model from the issue text.

Description

Graph performance

The original paper we base Data.Graph on expects lazy ST, but we use strict ST. Depending how the result is consumed, lazier might be better. For ordered traversals (producing lists rather than trees/forests), we can use strict ST along with unsafeInterleaveST, which may be faster.

Dominant language
Haskell
Stars
356
Forks
195
Avg merge
3d 42m
Merged PRs (30d)
5

Getting set up

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from haskell/containers

All issues in haskell/containers

Similar issues

More Haskell issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.