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

Idx adj list #51

Merged
merged 8 commits into from
Nov 20, 2023
Merged

Idx adj list #51

merged 8 commits into from
Nov 20, 2023

Conversation

pratzl
Copy link
Contributor

@pratzl pratzl commented Nov 20, 2023

No description provided.

When forward_range<vertex_t<G>> we can infer the edges range.
It's also reasonable to say the edge_value is the same as an edge.

Consider: vector<vector<tuple<int,double>>>
edges is vector<tuple<int,double>>
edge is tuple<int,double>
edge_value is tuple<int,double>
evf can be used to get the double (e.g. weight)

The only remaining default not easily derived is target_id
It's not clear this is needed. No need to have it until its needed is demonstrated.
Corrections.
Remove find_partition_vertex()
Remove PVId type  from naming conventions
Update compressed_graph description
Cleanup & editing
Changes from previous:
add description at beginning
add summary table of characteristics
remove shortest_distances functions,
update source to reflect discussions with Andrew and current implementation,
use longer names in source for clarity,
simplified wording of prerequisits and requires and returns sections.

Minor edits elsewhere
@pratzl pratzl merged commit 545091a into main Nov 20, 2023
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant