Make simplification of network deterministic
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 614
- Forks
- 459
- Avg merge
- 4d 14h
- Merged PRs (30d)
- 6
Description
The simplification of the network currently is not fully deterministic - we've experienced it now twice that the simplification yielded different results.
The effect is that runs are not always reproducible and it can introduce runaway components that are not supposed to exist (or be allocated to different buses).
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
No file or test is named in the issue. Locate the network-simplification entry point, reproduce the differing results, and compare repeated runs; done means simplification produces identical results across runs without the reported runaway or misallocated components.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- data
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100