JuliaGraphs / JuliaGraphs/Graphs.jl
Functions for Edge Adjacency
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
The functions for vertex adjacency are quite useful, but there isn't a similar functionality for edges. Would graphs benefit from similar edge versions of these?
I.e.
A function similar to has_edge but which takes two edges and returns true they share a vertex in the graph.
Also, an edge function counterpart to neighbors/all_neighbors that returns all the edges adj. to a provided edge?
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.
Research direction
Start by locating the existing has_edge, neighbors, and all_neighbors implementations and their tests. Compare their vertex-adjacency semantics with the proposed edge-based APIs, then determine the expected behavior for two edges and for listing adjacent edges. Done means the API and edge-adjacency behavior are clearly defined and covered by tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100