(pgtap) adding topologicalSort edge_cases test

Author: oddegen

pgtap/ordering/topologicalSort/edge_cases.pg

@@ -0,0 +1,174 @@
+
+/*PGR-GNU*****************************************************************
+
+Copyright (c) 2018  pgRouting developers
+Mail: [email protected]
+
+------
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation; either version 2 of the License, or
+(at your option) any later version.
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU General Public License for more details.
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software
+Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+ ********************************************************************PGR-GNU*/
+BEGIN;
+
+UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
+SELECT CASE WHEN NOT min_version('3.0.0') THEN plan(1) ELSE plan(14) END;
+
+CREATE OR REPLACE FUNCTION edge_cases()
+RETURNS SETOF TEXT AS
+$BODY$
+BEGIN
+
+IF NOT min_version('3.0.0') THEN
+  RETURN QUERY
+  SELECT skip(1, 'Function is new on 3.0.0');
+  RETURN;
+END IF;
+
+-- empty graph
+
+PREPARE q1 AS
+SELECT id, source, target, cost, reverse_cost
+FROM edges
+WHERE id > 18;
+
+RETURN QUERY
+SELECT is_empty('q1', 'Graph with 0 edge and 0 vertex');
+
+PREPARE r2 AS
+SELECT *
+FROM pgr_topologicalsort('q1');
+
+RETURN QUERY
+SELECT is_empty('r2', 'Graph with 0 edge and 0 vertex -> Empty row is returned');
+
+-- 1 vertex test
+
+PREPARE q3 AS
+SELECT id, source, 6 AS target, cost, -1 AS reverse_cost
+FROM edges
+WHERE id = 2;
+
+RETURN QUERY
+SELECT set_eq('q3', $$VALUES (2, 6, 6, -1, -1)$$, 'q3: Graph with one vertex');
+
+PREPARE r4 AS
+SELECT *
+FROM pgr_topologicalsort('q3');
+
+RETURN QUERY
+SELECT is_empty('r4', 'r4:  Graph with one vertex -> NULL returned');
+
+-- 2 vertices test (non DAG)
+
+PREPARE q5 AS
+SELECT id, source, target, cost, reverse_cost
+FROM edges
+WHERE id = 7;
+
+RETURN QUERY
+SELECT set_eq('q5', $$VALUES (7, 3, 7, 1, 1)$$, 'q5: Graph with two vertices (3->7 && 7->3)');
+
+PREPARE r6 AS
+SELECT *
+FROM pgr_topologicalsort('q5');
+
+RETURN QUERY
+SELECT throws_ok('r6', 'Graph is not DAG', 'r6: Graph with two vertices -> throws error');
+
+-- 2 vertices test (connected)
+
+PREPARE q7 AS
+SELECT id, source, target, cost, -1 AS reverse_cost
+FROM edges
+WHERE id = 7;
+
+RETURN QUERY
+SELECT set_eq('q7', $$VALUES (7, 3, 7, 1, -1)$$, 'q7: Graph with two vertices (3->7)');
+
+PREPARE r8 AS
+SELECT *
+FROM pgr_topologicalsort('q7');
+
+RETURN QUERY
+SELECT set_eq('r8', $$VALUES (1, 3), (2, 7)$$, 'r8: Graph with two vertices -> return in order');
+
+-- 2 vertices test (isolated)
+
+CREATE TABLE two_isolated_vertices_table (
+  id BIGSERIAL,
+  source BIGINT,
+  target BIGINT,
+  cost FLOAT DEFAULT -1,
+  reverse_cost FLOAT DEFAULT -1
+);
+
+INSERT INTO two_isolated_vertices_table (source, target) VALUES
+  (2, 2),
+  (1, 1);
+
+PREPARE q9 AS
+SELECT id, source, target, cost, reverse_cost
+FROM two_isolated_vertices_table;
+
+RETURN QUERY
+SELECT set_eq('q9', $$VALUES (1, 2, 2, -1, -1), (2, 1, 1, -1, -1)$$, 'q9: Graph with two isolated vertices 1 and 2');
+
+PREPARE r10 AS
+SELECT *
+FROM pgr_topologicalsort('q9');
+
+RETURN QUERY
+SELECT is_empty('r10', 'r10: Graph with two isolated vertices -> NULL returned');
+
+-- 3 vertices test
+
+PREPARE q11 AS
+SELECT id, source, target, 1 AS cost, -1 AS reverse_cost
+FROM edges
+WHERE id <= 2;
+
+RETURN QUERY
+SELECT set_eq('q11', $$VALUES (2, 6, 10, 1, -1), (1, 5, 6, 1, -1)$$, 'q9: Graph with three vertices (5->6->10)');
+
+PREPARE r12 AS
+SELECT *
+FROM pgr_topologicalsort('q11');
+
+RETURN QUERY
+SELECT set_eq('r12', $$VALUES (1, 5), (2, 6), (3, 10)$$, 'r12: Graph with three vertices -> return in order');
+
+-- 3 vertices test (a -> b, a -> c)
+
+PREPARE q13 AS
+SELECT id, source, target, 1 AS cost, -1 AS reverse_cost
+FROM edges
+WHERE source = 10;
+
+RETURN QUERY
+SELECT set_eq('q13', $$VALUES (3, 10, 15, 1, -1), (5, 10, 11, 1, -1)$$, 'q13: Graph with three vertices (10 -> 11 && 10 -> 15)');
+
+PREPARE r14 AS
+SELECT *
+FROM pgr_topologicalsort('q13');
+
+RETURN QUERY
+SELECT set_eq('r14', $$VALUES (1, 10), (2, 15), (3, 11)$$, 'r14: Graph with three vertices -> return in order');
+
+
+END
+$BODY$
+LANGUAGE plpgsql;
+
+SELECT edge_cases();
+
+SELECT * FROM finish();
+ROLLBACK;