ITensor / ITensor/ITensorNetworks.jl
`internal_edges` function
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 128
- Forks
- 23
- Avg merge
- 4d 7h
- Merged PRs (30d)
- 7
Description
This is a good idea for a generic graph function. It is the complement of the edge boundary of a subgraph (https://en.wikipedia.org/wiki/Boundary_(graph_theory) and boundary_edges added in https://github.com/mtfishman/NamedGraphs.jl/pull/20).
As we discussed, a simple implementation would be internal_edges(g::AbstractGraph, vertices) = edges(subgraph(g, vertices)). Then this function could be defined as internal_edges(P::AbstractProjTTNO) = internal_edges(underlying_graph(P), sites(P)).
Originally posted by @mtfishman in https://github.com/mtfishman/ITensorNetworks.jl/pull/18#discussion_r1056495105
Contributor guide
No contributing guide indexed for this repository
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 reading the existing boundary_edges implementation and the subgraph and edges APIs, then inspect AbstractProjTTNO, underlying_graph, and sites. Done means the generic graph function and the AbstractProjTTNO form consistently return the internal edges, with behavior checked alongside the existing boundary-edge functionality.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- backend-api-design
- Issue type
- Feature
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100