Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Graph cost setting method improvement #460

Open
pedrocamargo opened this issue Oct 29, 2023 · 0 comments
Open

Graph cost setting method improvement #460

pedrocamargo opened this issue Oct 29, 2023 · 0 comments
Assignees
Labels
enhancement New feature or request

Comments

@pedrocamargo
Copy link
Contributor

BEFORE REQUESTING A FEATURE

Purpose of use
Manipulating graph costs and other characteristics is not as straightforward as it seems in two cases:

  1. Disconnecting links (setting a_node=b_node) currently requires a rebuild of the graph, as the correlation between compact_graph and the graph is not straightforward
  2. Manipulating costs in the graph currently needs to be done in the network and then the graph rebuilt for the change to be propagated to the graph and compact_graph.

Is your feature request related to a problem? Please describe.
The first issue would help criticality analysis implementations, while the second would greatly speed up map-matching implementations where we want to penalize or discount specific links

Describe the solution you'd like
1.1 A method to temporarily disconnect a link
1.2 A method to reconnect the disconnected links
1.3 A method to penalize costs in the graph and compact_graph

@pedrocamargo pedrocamargo added the enhancement New feature or request label Oct 29, 2023
@pedrocamargo pedrocamargo self-assigned this Oct 29, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant