Add Python goody to create a graph out of a list of edges
Nobody has claimed this yet.
Assessment
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Newbie friendliness
- 30/100
Research direction
The issue describes a Python utility that creates a graph from a list of edges, with edges treated as bidirectional and repeated edges allowed. Start by locating the repository’s existing Python goodies and their tests; done means the utility follows those conventions and handles both stated edge cases.
Written by the indexing model from the issue text.
Description
Edges are bidirectional, with possible repeats.
- Dominant language
- TypeScript
- Stars
- 20
- Forks
- 12
- PR merge metrics
- No merged PRs in 30d
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from code-chronicles-code/leetcode-curriculum
-
enhancement kotlin
Difficulty 2/5 1-3 hours Newbie friendliness 68/100
-
good first issue tests
Difficulty 1/5 1-3 hours Newbie friendliness 82/100
-
good first issue tests
Difficulty 2/5 1-3 hours Newbie friendliness 64/100
-
good first issue tests
Difficulty 2/5 1-3 hours Newbie friendliness 65/100
-
bug
Difficulty 4/5 3-5 days Newbie friendliness 30/100
code-chronicles-code/leetcode-curriculum#418 · 1 comment ·
All issues in code-chronicles-code/leetcode-curriculum
Similar issues
-
Difficulty 2/5 1-3 hours Newbie friendliness 70/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 75/100
mksglu/context-mode#1200 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 75/100
jaegertracing/jaeger-ui#4506 ·
-
area:desktop area:ui bug platform:macos
Difficulty 2/5 1-3 hours Newbie friendliness 75/100
anthropics/claude-code#96687 ·
-
good first issue
Difficulty 1/5 Under an hour Newbie friendliness 95/100
AOSSIE-Org/DebateAI#582 · 2 comments ·