jasonrogena / jasonrogena/ma3map-client_android
Optimal Coefficient Gradients
Open
enhancement
- Dominant language
- Java
- Stars
- 7
- Forks
- 3
- PR merge metrics
- No merged PRs in 30d
Description
Need to get optimal coefficient gradients the following edge attributes in the commute shortest path graph:
- Walking distance between nodes
- Transfers between connected nodes (boolean value)
- Time in between nodes
Contributor guide
No contributing guide indexed for this repository
Research direction
The issue names no files, tests, or entry points. Start by locating the commute shortest path graph implementation in the Android client and determine how walking distance, transfers, and time are represented on edges. Before coding, clarify the optimization objective and how completion will be verified for the three coefficient gradients.
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
- 25/100