This project forked from pgrouting/pgrouting
Repository contains pgRouting library. Development branch is "develop", stable branch is "master"
Home Page: http://www.pgrouting.org
License: GNU General Public License v2.0
Document that edge ids cannot be duplicated in the input
change things like:
int64_t out_edge_id = digraph.graph[*e_outIt].id;
to
auto out_edge_id = digraph.graph[*e_outIt].id
throw an error
proofOfConcept1 & proofOfConcept2
SELECT id*100 AS id, source*1000 as source, target*1000 as target , cost FROM edge_table where id in (5,9,11);
id | source | target | cost
------+--------+--------+------
500 | 3000 | 6000 | 1
900 | 6000 | 9000 | 1
1100 | 6000 | 11000 | 1
(3 rows)
SELECT * FROM pgr_turnPenaltyGraph( 'SELECT id*100 AS id, source*1000 as source, target*1000 as target , cost FROM edge_table where id in (5,9,11)' );
seq | source | target | cost | original_source_vertex | original_source_edge | original_target_vertex | original_target_edge
-----+--------+--------+------+------------------------+----------------------+------------------------+----------------------
1 | 1 | 4 | 1 | 3000 | 500 | 6000 | 500
2 | 2 | 5 | 1 | 6000 | 900 | 9000 | 900
3 | 3 | 6 | 1 | 6000 | 1100 | 11000 | 1100
4 | 4 | 2 | 0 | 6000 | 500 | 6000 | 900
5 | 4 | 3 | 0 | 6000 | 500 | 6000 | 1100
(5 rows)
bash tools/scripts/code_checker.sh turnPenaltyGraph
Should return no errors
Executing with the full sample data (no multiplication)
SELECT * FROM pgr_turnPenaltyGraph('
SELECT id AS id, source AS source, target AS target,
cost, reverse_cost
FROM edge_table');
after getting the results:
UPDATE result2_vertices_pgr AS r SET original_id = v.id
FROM edge_table_vertices_pgr AS v WHERE v.id = r.id;
and
UPDATE result2_vertices_pgr SET original_id = id
WHERE id > 0;
give the same result
check and throw error
Related to: #18
Related to: #3
This proof of concept shows how we can convert the results table into a version that has the same columns as pgr_lineGraph(). The next step is to prove that we convert this new version of the turnpenaltygraph results table back to the original version.
Currently we can deduce the original_source_vertex and the original_target_vertex of the original table from the new version, but we need to figure out how to deduce both the original_source_edge and the original_target_edge.
turnPenaltyGraph.rst has an example usage section that references a graph not present in the sample data
Executing with the full sample data (no multiplication)
SELECT * FROM pgr_turnPenaltyGraph('
SELECT id AS id, source AS source, target AS target,
cost, reverse_cost
FROM edge_table');
check and throw ERROR
Related to #3
The format that the results table should be changed to save storage space
From
seq | source | target | cost | original_source_vertex | original_source_edge | original_target_vertex | original_target_edge
-----+--------+--------+------+------------------------+----------------------+------------------------+----------------------
1 | 1 | 3 | 1 | 6 | 11 | 11 | 11
2 | 2 | 4 | 1 | 11 | 13 | 12 | 13
3 | 3 | 2 | 0 | 11 | 11 | 11 | 13
To
id | 'e' |source| target | cost
id | 'v' |o_vid | o_eid | irrelevant
-----+------+------+--------+--------+
1 | 'e' | 1 | 3 | 1
2 | 'e' | 2 | 4 | 1
3 | 'e' | 3 | 2 | 0
1 | 'v' | 6 | 11 | -1
2 | 'v' | 11| 13 | -1
3 | 'v' | 11| 11 | -1
4 | 'v' | 12| 13 | -1
The number of edges with cost 1 is the same number of edges of the original data:
The following queries give the same result
WITH
going_edges AS (SELECT count(*) FROM edge_table WHERE cost > 0),
coming_edges AS (SELECT count(*) FROM edge_table WHERE reverse_cost > 0)
SELECT a.count + b.count FROM going_edges AS a, coming_edges AS b;
SELECT count(*) FROM pgr_turnPenaltyGraph('
SELECT id AS id, source AS source, target AS target,
cost, reverse_cost
FROM edge_table') where cost = 1;
SELECT id*100 AS id, source*1000 as source, target*1000 as target , cost, reverse_cost FROM edge_table where id in (5,9,11);
id | source | target | cost | reverse_cost
------+--------+--------+------+--------------
500 | 3000 | 6000 | 1 | -1
900 | 6000 | 9000 | 1 | 1
1100 | 6000 | 11000 | 1 | -1
(3 rows)
We would like to find a more proper name for this graph transformation function
Two names for the same type convert to one type
typedef graph::Pgr_lineGraph <
boost::adjacency_list < boost::vecS, boost::vecS,
boost::bidirectionalS,
Line_vertex, Basic_edge >,
Line_vertex, Basic_edge > LinearDirectedGraph;
typedef graph::Pgr_turnPenaltyGraph <
boost::adjacency_list < boost::vecS, boost::vecS,
boost::bidirectionalS,
Line_vertex, Basic_edge >,
Line_vertex, Basic_edge > LinearDirectedGraph;
@cvvergara will take care of this
For any value of x where x is a vertex id:
The following 2 queries give the same count
SELECT count(*) FROM pgr_turnPenaltyGraph('SELECT id,source,target,cost FROM edge_table') WHERE original_source_vertex=x AND original_target_vertex=x;
SELECT count(*) FROM pgr_lineGraph('SELECT id AS id, source AS source, target AS target , cost FROM edge_table WHERE source=x or target=x');
bash tools/scripts/code_checker.sh lineGraph
The follwing query
select * from pgr_turnPenaltyGraph(
'select id, source, target, cost, reverse_cost from edge_table where id =1');
seq | source | target | cost | original_source_vertex | original_source_edge | original_target_vertex | original_target_edge
-----+--------+--------+------+------------------------+----------------------+------------------------+----------------------
1 | 2 | 2 | 1 | 1 | 1 | 1 | 1
2 | 2 | 4 | 1 | 1 | 1 | 2 | 1
3 | 4 | 2 | 1 | 2 | 1 | 1 | 1
4 | 4 | 4 | 1 | 2 | 1 | 2 | 1
(4 rows)
Should have the same results as the followin query
SELECT * FROM pgr_turnPenaltyGraph(
'select id, source, target, cost from edge_table where id = 1
UNION ALL
select id, target AS source, source AS target, reverse_cost AS cost from edge_table where id = 1'
)
seq | source | target | cost | original_source_vertex | original_source_edge | original_target_vertex | original_target_edge
-----+--------+--------+------+------------------------+----------------------+------------------------+----------------------
1 | 2 | 2 | 1 | 1 | 1 | 1 | 1
2 | 2 | 4 | 1 | 1 | 1 | 2 | 1
3 | 4 | 2 | 1 | 2 | 1 | 1 | 1
4 | 4 | 4 | 1 | 2 | 1 | 2 | 1
(4 rows)
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
Django
The Web framework for perfectionists with deadlines.
Laravel
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
Microsoft
Open source projects and samples from Microsoft.
Google
Google ❤️ Open Source for everyone.
Alibaba
Alibaba Open Source for everyone
D3
Data-Driven Documents codes.
Tencent
China tencent open source team.