Skip to content

Week 3 sloanordering #451

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.

Sign up for GitHub

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

Merged
merged 6 commits into from
Jun 23, 2025
Merged

Week 3 sloanordering #451

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
190ef19
CCMerge remote-tracking branch 'pgr/develop' into week-3-sloanordering
bipashabg Jun 16, 2025
152a987
Merge remote-tracking branch 'upstream/bipashabg-2025' into week-3-sl…
bipashabg Jun 16, 2025
dc3949e
[doc/ordering] remove space in function definition
bipashabg Jun 16, 2025
e4142e1
adjust parameters and data types according to boost requirements
bipashabg Jun 17, 2025
2c64e03
[src/ordering] fix ordering_process.cpp file
bipashabg Jun 18, 2025
3b6a636
[sql/ordering] fix parameters and licenses in sql files
bipashabg Jun 19, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion doc/ordering/ordering-family.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,7 @@ Ordering - Family of functions
.. official-start

* :doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph.
* :doc:`pgr_sloanOrdering` - Return sloan ordering of an undirected graph.
* :doc:`pgr_sloanOrdering` - Return sloanordering of an undirected graph.
* :doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed
acyclic graph.

Expand Down
2 changes: 1 addition & 1 deletion include/process/ordering_process.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,7 +44,7 @@ typedef struct II_t_rt II_t_rt;
extern "C" {
#endif

void pgr_process_ordering(const Edge_t*, size_t, int64_t, int64_t, II_t_rt **, size_t *);
void pgr_process_ordering(const char*, int16_t, II_t_rt **, size_t *);

#ifdef __cplusplus
}
Expand Down
153 changes: 36 additions & 117 deletions locale/en/LC_MESSAGES/pgrouting_doc_strings.po
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@ msgid ""
msgstr ""
"Project-Id-Version: pgRouting v3.8\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2025-06-14 12:05+0000\n"
"POT-Creation-Date: 2025-06-09 15:36+0000\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
"Language-Team: LANGUAGE <[email protected]>\n"
Expand Down Expand Up @@ -3420,6 +3420,9 @@ msgid ""
"of an undirected graph."
msgstr ""

msgid ":doc:`pgr_sloanOrdering` - Return sloan ordering of an undirected graph."
msgstr ""

msgid ""
":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed"
" acyclic graph."
Expand Down Expand Up @@ -3968,12 +3971,6 @@ msgstr ""
msgid "Signatures promoted to official"
msgstr ""

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__"
msgstr ""

msgid "Make official the Combinations signature on the official functions"
msgstr ""

msgid "pgr_aStar(Combinations)"
msgstr ""

Expand Down Expand Up @@ -4013,22 +4010,7 @@ msgstr ""
msgid "pgr_pushRelabel(Combinations)"
msgstr ""

msgid "SQL signatures and output standardization"
msgstr ""

msgid ""
"`#2904 <https://github.com/pgRouting/pgrouting/issues/2904>`__ "
"Standardize output columns of functions with different output columns "
"within overloads"
msgstr ""

msgid "Official functions"
msgstr ""

msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__"
msgstr ""

msgid "pgr_withPoints"
msgid "SQL signatures modification on functions"
msgstr ""

msgid ""
Expand All @@ -4039,21 +4021,6 @@ msgstr ""
msgid "Combinations signature promoted to official."
msgstr ""

msgid ""
"`#2907 <https://github.com/pgRouting/pgrouting/issues/2907>`__ "
"pgr_bellmanFord"
msgstr ""

msgid ""
"`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__ "
"pgr_edwardMoore"
msgstr ""

msgid ""
"`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ "
"pgr_DAGshortestPath"
msgstr ""

msgid "Removal of SQL deprecated signatures"
msgstr ""

Expand Down Expand Up @@ -4280,16 +4247,6 @@ msgid ""
"precision,double precision,boolean)"
msgstr ""

msgid ""
"`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ "
"_pgr_dagshortestpath(text,text,boolean,boolean)"
msgstr ""

msgid ""
"`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ "
"_pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)"
msgstr ""

msgid ""
"`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__: Remove "
"unused internal functions"
Expand Down Expand Up @@ -4373,11 +4330,6 @@ msgstr ""
msgid "Internal C/C++ functions in legacy"
msgstr ""

msgid ""
"`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ "
"_pgr_dagshortestpath"
msgstr ""

msgid "All releases"
msgstr ""

Expand Down Expand Up @@ -4487,15 +4439,6 @@ msgstr ""
msgid ":doc:`pgr_bdDijkstra` [1]_"
msgstr ""

msgid ":doc:`pgr_bellmanFord` [3]_"
msgstr ""

msgid ":doc:`pgr_dagShortestPath` [3]_"
msgstr ""

msgid ":doc:`pgr_edwardMoore` [3]_"
msgstr ""

msgid ":doc:`pgr_withPoints` [2]_"
msgstr ""

Expand All @@ -4514,9 +4457,6 @@ msgstr ""
msgid "Official function in v4.0.0"
msgstr ""

msgid "Experimental or proposed in v4.0.0"
msgstr ""

msgid "Migration of cost functions"
msgstr ""

Expand Down Expand Up @@ -4653,34 +4593,22 @@ msgid ""
"functions` are |short-generic-result|"
msgstr ""

msgid "``pgr_dijkstra``"
msgstr ""

msgid "v < 3.5"
msgstr ""

msgid "|old-generic-result|"
msgstr ""

msgid "``pgr_aStar``"
msgstr ""

msgid "v < 3.6"
msgstr ""

msgid "``pgr_bdDijkstra``"
msgstr ""

msgid "``pgr_bellmanFord``"
msgid "|old-generic-result|"
msgstr ""

msgid "``pgr_dagShortestPath``"
msgid "``pgr_dijkstra``"
msgstr ""

msgid "|result-1-1|"
msgid "v < 3.5"
msgstr ""

msgid "``pgr_edwardMoore``"
msgid "``pgr_bdDijkstra``"
msgstr ""

msgid "``pgr_withPoints``"
Expand Down Expand Up @@ -4758,18 +4686,6 @@ msgid ""
"example."
msgstr ""

msgid "Using ``pgr_DAGshortestPath``"
msgstr ""

msgid ""
"Migrating `this v3.8 "
"<https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-"
"one>`__ example."
msgstr ""

msgid "This applies to all signatures of ``pgr_DAGshortestPath``"
msgstr ""

msgid "Examples for One to Many with one route result"
msgstr ""

Expand Down Expand Up @@ -7606,17 +7522,17 @@ msgstr ""
msgid ""
"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio "
"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, "
"Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, "
"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, "
"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic "
"Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, "
"Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko "
"Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, "
"Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, "
"Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, "
"Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, "
"Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan "
"Jain, Virginia Vergara, Yige Huang"
"Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano "
"Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, "
"David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian "
"Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu,"
" Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, "
"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, "
"Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed "
"Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina "
"Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, "
"Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, "
"Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
msgstr ""

msgid "Corporate Sponsors (in alphabetical order)"
Expand Down Expand Up @@ -8777,6 +8693,18 @@ msgstr ""
msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr ""

msgid "Returns set of |result-1-1|"
msgstr ""

msgid "Returns set of |result-1-m|"
msgstr ""

msgid "Returns set of |result-m-1|"
msgstr ""

msgid "Using a combinations table on an **undirected** graph."
msgstr ""

msgid ""
"`Boost: Bellman Ford "
"<https://www.boost.org/libs/graph/doc/bellman_ford_shortest.html>`__"
Expand Down Expand Up @@ -9007,15 +8935,6 @@ msgid ""
"(i.e :math:`1``)"
msgstr ""

msgid "Returns set of |result-1-1|"
msgstr ""

msgid "Returns set of |result-1-m|"
msgstr ""

msgid "Returns set of |result-m-1|"
msgstr ""

msgid ""
"`Boost: Breadth First Search "
"<https://www.boost.org/libs/graph/doc/breadth_first_search.html>`__"
Expand Down Expand Up @@ -10469,9 +10388,6 @@ msgstr ""
msgid "pgr_dagShortestPath(Combinations)"
msgstr ""

msgid "..rubric:: Version 3.0.0"
msgstr ""

msgid ""
"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm"
" that solves the shortest path problem for weighted directed acyclic "
Expand Down Expand Up @@ -11895,7 +11811,10 @@ msgstr ""
msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr ""

msgid "Using a combinations table on an **undirected** graph."
#, python-brace-format
msgid ""
"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed**"
" graph"
msgstr ""

msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm"
Expand Down
Loading
Loading