jasonrogena / jasonrogena/ma3map-client_android
Estimating time in Shortest Path Graph edges
Open
Nobody has claimed this yet.
help wanted
question
- Dominant language
- Java
- Stars
- 7
- Forks
- 3
- PR merge metrics
- No merged PRs in 30d
Description
How do you estimate time between nodes in the ma3map Shortest Path Graph considering a node represents a section of a route, terminated on both ends by stops
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. Start by tracing the Shortest Path Graph and the ma3map Android client's route-node representation, then clarify how time should be estimated between sections terminated by stops. Done requires an agreed estimation method and a concrete implementation scope.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- android, java
- Domain
- mobile
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 15/100