Reviewing files that changed from the base of the PR and between 2cd5598 and 25f5efd.

• doc/contraction/pgr_contractionDeadEnd.rst (1 hunks)
• doc/contraction/pgr_contractionLinear.rst (2 hunks)
• docqueries/contraction/contractionLinear.result (3 hunks)
• locale/en/LC_MESSAGES/pgrouting_doc_strings.po (2 hunks)
• locale/pot/pgrouting_doc_strings.pot (2 hunks)

locale/pot/pgrouting_doc_strings.pot (2)

11-11: POT-Creation-Date updated.

The POT-Creation-Date has been updated to March 30, 2025, reflecting when these translation templates were last regenerated. This is an expected change as part of the documentation update process.

---

8152-8152: Parameter name simplified in documentation.

The parameter forbidden_vertices has been simplified to just forbidden in the documentation, making the API more concise while maintaining its functionality. This aligns with the PR objective of implementing minor fixes to enhance documentation clarity.

locale/en/LC_MESSAGES/pgrouting_doc_strings.po (2)

11-11: Verify the POT-Creation-Date timestamp.

The POT-Creation-Date shows "2025-03-30", which appears to be set in the future. Please verify if this is correct or if there's a timestamp issue in your localization build process.

---

9492-9492: Parameter name simplification looks good.

The change from using forbidden_vertices to forbidden in the options list aligns with the PR objective to simplify parameter names. This change improves consistency across documentation.

doc/contraction/pgr_contractionDeadEnd.rst (1)

61-61: Parameter name simplified for consistency

The parameter name has been changed from forbidden_vertices to forbidden, making it more concise while maintaining clarity. This change aligns with other parameter naming conventions in the codebase and improves documentation readability.

doc/contraction/pgr_contractionLinear.rst (2)

47-47: Parameter list simplified for consistency

The options parameter list has been simplified from [directed, max_cycles, forbidden_vertices] to [directed, forbidden]. This change aligns with the parameter naming convention used in pgr_contractionDeadEnd, creating a more consistent API across the contraction functions.

---

133-141: Parameter names updated for consistency

The parameter names have been renamed from forbidden_vertices to forbidden and from max_cycles to cycles. This aligns with the changes in the function signature and creates a more consistent naming convention across the codebase.

docqueries/contraction/contractionLinear.result (12)

9-14: Fixed SQL query execution results

The SQL query now executes successfully and returns meaningful results instead of the previous error. This confirms that the function implementation now works correctly with the updated parameter names.

---

23-26: Correctly handles directed graph with no linear edges

The function now correctly returns zero rows when processing a directed graph where linearity is not symmetrical, as expected according to the documentation.

---

34-38: Successfully processes undirected graph

The function now correctly processes an undirected graph and returns the expected contracted edge.

---

46-51: Successfully handles directed graph with symmetrical linearity

The function now correctly processes a directed graph with symmetrical linearity, returning the two expected directed edges.

---

59-63: Successfully processes undirected graph with symmetrical linearity

The function correctly handles the undirected version of the graph and returns a single undirected edge, as expected.

---

71-75: Successfully contracts multiple vertices in sequence

The function correctly handles sequential contraction, contracting both vertices 2 and 3 in a single operation, as shown by the contracted_vertices array containing both values.

---

79-83: Successfully adds schema changes to support contraction

The ALTER TABLE statements now execute successfully, adding the necessary columns to store contraction state:

• is_contracted flag for vertices
• is_new and contracted_vertices for edges

These are essential for tracking which vertices have been contracted and which edges were created during the contraction process.

---

98-104: Successfully identifies contracted vertices

The query correctly identifies vertices 3, 15, and 17 as contracted, which matches the output from the initial contraction query.

---

111-122: Successfully creates contracted graph view

The view definition now executes successfully, creating a view that includes only non-contracted vertices and their associated edges. This is a crucial step in using the contracted graph for subsequent routing algorithms.

---

124-142: Contracted graph includes original and new edges

The contracted graph view correctly includes both original edges (IDs 1-18) and new edges created by the contraction algorithm (IDs 19-21). This ensures that the contracted graph maintains connectivity while reducing the overall graph size.

---

146-152: Successfully routes on contracted graph

The Dijkstra algorithm now successfully finds a path on the contracted graph, demonstrating that the contraction preserves the correct connectivity between remaining vertices.

---

164-172: Successfully routes from/to contracted vertices

The query successfully finds a path that includes a contracted vertex (17), demonstrating that the approach of including edges connected to contracted vertices works correctly.