Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #9 from nike0good/toposort
[toposort] PR of week 2
- Loading branch information
Showing
18 changed files
with
344 additions
and
110 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,44 @@ | ||
| BEGIN; | ||
| BEGIN | ||
| SET client_min_messages TO NOTICE; | ||
| SET | ||
| SELECT * FROM pgr_topologicalSort( | ||
| 'SELECT id, source, target, cost, reverse_cost FROM edge_table' | ||
| ); | ||
| ERROR: function pgr_topologicalsort(unknown) does not exist | ||
| LINE 1: SELECT * FROM pgr_topologicalSort( | ||
| ^ | ||
| HINT: No function matches the given name and argument types. You might need to add explicit type casts. | ||
| -- q1 | ||
| SELECT * FROM pgr_topologicalSort( | ||
| 'SELECT id, source, target, cost, reverse_cost | ||
| FROM edge_table | ||
| WHERE id < 17' | ||
| ); | ||
| ERROR: current transaction is aborted, commands ignored until end of transaction block | ||
| -- q2 | ||
| SELECT * FROM pgr_topologicalSort( | ||
| 'SELECT id, source, target, cost, reverse_cost | ||
| FROM edge_table | ||
| WHERE id = 18' | ||
| ); | ||
| ERROR: current transaction is aborted, commands ignored until end of transaction block | ||
| -- q3 | ||
| SELECT * FROM pgr_topologicalSort( | ||
| $$ | ||
| SELECT id, source, target, cost, reverse_cost FROM edge_table | ||
| where source = any (ARRAY(SELECT node FROM pgr_connectedComponents( | ||
| 'SELECT id, source, target, cost, reverse_cost FROM edge_table ') | ||
| WHERE component = 14) | ||
| ) | ||
| OR | ||
| target = any (ARRAY(SELECT node FROM pgr_connectedComponents( | ||
| 'SELECT id, source, target, cost, reverse_cost FROM edge_table ') | ||
| WHERE component = 14) | ||
| ) | ||
| $$ | ||
| ); | ||
| ERROR: current transaction is aborted, commands ignored until end of transaction block | ||
| -- q4 | ||
| ROLLBACK; | ||
| ROLLBACK |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,121 @@ | ||
| /*PGR-GNU***************************************************************** | ||
| File: pgr_topologicalSort.hpp | ||
| Copyright (c) 2015 pgRouting developers | ||
| Mail: project@pgrouting.org | ||
| Function's developer: | ||
| Copyright (c) 2019 Hang Wu | ||
| mail: nike0good@gmail.com | ||
| ------ | ||
| 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*/ | ||
|
|
||
| #ifndef INCLUDE_TOPOLOGICALSORT_PGR_TOPOLOGICALSORT_HPP_ | ||
| #define INCLUDE_TOPOLOGICALSORT_PGR_TOPOLOGICALSORT_HPP_ | ||
| #pragma once | ||
|
|
||
| #include <boost/config.hpp> | ||
| #include <boost/graph/adjacency_list.hpp> | ||
| #include <boost/graph/graph_traits.hpp> | ||
| #include <boost/graph/one_bit_color_map.hpp> | ||
| #include <boost/graph/stoer_wagner_min_cut.hpp> | ||
| #include <boost/property_map/property_map.hpp> | ||
| #include <boost/typeof/typeof.hpp> | ||
| #include <boost/graph/topological_sort.hpp> | ||
|
|
||
| #include <iostream> | ||
| #include <vector> | ||
| #include <algorithm> | ||
| #include <sstream> | ||
| #include <functional> | ||
| #include <limits> | ||
|
|
||
| #include "cpp_common/basePath_SSEC.hpp" | ||
| #include "cpp_common/pgr_base_graph.hpp" | ||
|
|
||
| template < class G > class Pgr_topologicalSort; | ||
| // user's functions | ||
| // for development | ||
|
|
||
| //****************************************** | ||
|
|
||
| template < class G > | ||
| class Pgr_topologicalSort { | ||
| public: | ||
| typedef typename G::V V; | ||
| typedef typename G::E E; | ||
| typedef typename G::E_i E_i; | ||
|
|
||
| std::vector<pgr_topologicalSort_t> topologicalSort( | ||
| G &graph); | ||
|
|
||
| private: | ||
| std::vector< pgr_topologicalSort_t > | ||
| generatetopologicalSort( | ||
| const G &graph ) { | ||
| std::vector< pgr_topologicalSort_t > results; | ||
|
|
||
| // auto parities = boost::make_one_bit_color_map( | ||
| // num_vertices(graph.graph), | ||
| // get(boost::vertex_index, graph.graph)); | ||
|
|
||
| // double w = stoer_wagner_min_cut( | ||
| // graph.graph, | ||
| // get(&G::G_T_E::cost, graph.graph), | ||
| // boost::parity_map(parities)); | ||
|
|
||
| // double totalcost = 0; | ||
| // E_i ei, ei_end; | ||
| // for (boost::tie(ei, ei_end) = edges(graph.graph); ei != ei_end; ei++) { | ||
| // auto s = source(*ei, graph.graph); | ||
| // auto t = target(*ei, graph.graph); | ||
|
|
||
| // if (get(parities, s) != get(parities, t)) { | ||
| // pgr_topologicalSort_t tmp; | ||
|
|
||
| // tmp.cost = graph[*ei].cost; | ||
|
|
||
| // auto edge_id = | ||
| // graph.get_edge_id( | ||
| // source(*ei, graph.graph), | ||
| // target(*ei, graph.graph), | ||
| // tmp.cost); | ||
|
|
||
| // tmp.edge = edge_id; | ||
| // totalcost += tmp.cost; | ||
| // tmp.mincut = totalcost; | ||
| // results.push_back(tmp); | ||
| // } | ||
| // } | ||
|
|
||
| // pgassert(w == totalcost); | ||
| pgr_topologicalSort_t tmp; | ||
| tmp.seq=tmp.sorted_v=1; | ||
| results.push_back(tmp); | ||
| return results; | ||
| } | ||
| }; | ||
|
|
||
| template < class G > | ||
| std::vector<pgr_topologicalSort_t> | ||
| Pgr_topologicalSort< G >::topologicalSort( | ||
| G &graph) { | ||
| // pgassert(num_vertices(graph.graph) > 1); | ||
| return generatetopologicalSort( | ||
| graph); | ||
| } | ||
|
|
||
|
|
||
| #endif // INCLUDE_TOPOLOGICALSORT_PGR_TOPOLOGICALSORT_HPP_ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,14 @@ | ||
| \i setup.sql | ||
|
|
||
| SELECT plan(2); | ||
|
|
||
| SELECT has_function('pgr_topologicalSort', | ||
| ARRAY['text']); | ||
|
|
||
| SELECT function_returns('pgr_topologicalSort', | ||
| ARRAY['text'], | ||
| 'setof record'); | ||
|
|
||
|
|
||
| SELECT * FROM finish(); | ||
| ROLLBACK; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
4 changes: 2 additions & 2 deletions
4
sql/topological_sort/CMakeLists.txt → sql/topologicalSort/CMakeLists.txt
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.