ITensor / ITensor/ITensorNetworks.jl
Implement `Graphs.union` for `ITensorNetwork` (or general `DataGraph`s)
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 128
- Forks
- 23
- Avg merge
- 4d 7h
- Merged PRs (30d)
- 7
Description
Implement overloads of Graphs.union for DataGraphs, like ITensorNetwork and IndsNetwork (see the definition on Wikidedia as the graph resulting from taking the union of the vertices and edges of the two graphs).
An application is merging the indices of two IndsNetworks (i.e. unioning the indices of shared vertices and edges), for example functionality being added in #9.
A generic interface will have to handle how to merge the metadata of vertices and edges that are shared by the two graphs being unioned, such as passing a custom function that defines how the merge will happen.
Originally posted by @mtfishman in https://github.com/mtfishman/ITensorNetworks.jl/pull/9#discussion_r1010417820
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 with the Graphs.union documentation and the definitions of DataGraphs, ITensorNetwork, and IndsNetwork mentioned in the issue. Determine how unioned vertices and edges should be represented, including a defined way to merge metadata for shared elements. Done means the relevant overloads exist and cover the stated graph-union behavior.
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
- 32/100