MATPOWER / MATPOWER/matpower

Hope distance between two buses

Open
#262 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
MATLAB
Stars
592
Forks
184
PR merge metrics
No merged PRs in 30d

Description

Is there a function to calculate the hop distance (i.e. number of shortest steps to take to get from one bus to another) for a given PSSE RAW file?

Thanks

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by examining how MATPOWER handles a PSSE RAW file and represents buses and their connections. Determine whether an existing entry point already exposes graph or path information; otherwise define the function's input and output around the requested hop distance. Done means the shortest number of steps between two buses can be calculated for a given RAW file, with behavior verified on a representative network.

Written by the indexing model from the issue text.

Assessment

Tech stack
matlab
Domain
tooling
Issue type
Feature
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.