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

List of possible implementations from boost #360

Closed
cvvergara opened this issue Jan 2, 2024 · 8 comments
Closed

List of possible implementations from boost #360

cvvergara opened this issue Jan 2, 2024 · 8 comments

Comments

@cvvergara
Copy link
Member

Please use a comment here to indicate you work intention,

For example, suppose that pgr_dijsktra does not exist, and I am planning to work on it, so in a comment in this issue I write:

I am Vicky Vergara
Planning to implement: https://www.boost.org/doc/libs/1_84_0/libs/graph/doc/dijkstra_shortest_paths.html
with a tentative name: pgr_dijkstra

@dikwickley
Copy link

dikwickley commented Jan 3, 2024

I am Aniket Singh Rawat
Planning to implement: https://www.boost.org/doc/libs/1_82_0/libs/graph/doc/topological_sort.html
with a tentative name: prg_toposort

Why?

What is Topological Sorting?

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u-v, vertex u comes before v in the ordering.

Applications

Topological sorting has many real-world use cases

  • Dependency resolution
  • Task Scheduling
  • Deadlock detection
  • and many others

@cvvergara
Copy link
Member Author

@dikwickley We already have topological sort implemented
https://docs.pgrouting.org/latest/en/pgr_topologicalSort.html

@dikwickley
Copy link

@cvvergara Thanks for pointing that out. I would like to implement another one of Sparse Matrix Ordering Algorithms.

I am Aniket Singh Rawat
Planning to implement: https://www.boost.org/doc/libs/1_82_0/libs/graph/doc/sloan_ordering.htm
with a tentative name: pgr_sloanOrdering

@Aniket-debug
Copy link
Contributor

Aniket-debug commented Feb 22, 2024

I am Aniket Agarwal considering betweenness_centrality_clustering, algorithms from the Boost Graph Library. I'm tentatively naming the method pgr_betweennessCentralityClustering.

betweenness_centrality_clustering: https://www.boost.org/doc/libs/1_82_0/libs/graph/doc/bc_clustering.html

@dhruvmehtaaa
Copy link

dhruvmehtaaa commented Feb 22, 2024

I am Dhruv Mehta
Planning to implement: https://www.boost.org/doc/libs/1_84_0/libs/graph/doc/planar_canonical_ordering.html

with a tentative name: pgr_planarCanonicalOrdering

@aryan1010
Copy link
Contributor

aryan1010 commented Feb 22, 2024

Hi, I m Aryan Gupta
Planning to implement: https://www.boost.org/doc/libs/1_84_0/libs/graph/doc/maximum_adjacency_search.html

with a tentative name: pgr_maxAdjacencySearch

@wayne-xyz
Copy link

wayne-xyz commented Feb 25, 2024

Hi, I am Rongwei Ji
Plananing to implement: https://www.boost.org/doc/libs/1_84_0/libs/graph/doc/howard_cycle_ratio.html

with a tentative name : pgr_maxMinCycleRatio

@bedupako12mas
Copy link

Hi, I am Arun Thakur
Planning to implement: https://www.boost.org/doc/libs/1_84_0/libs/graph/doc/betweenness_centrality.html

with a tentative name: pgr_brandesBetweennessCentrality

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

7 participants