oqgraph-dev team mailing list archive
-
oqgraph-dev team
-
Mailing list archive
-
Message #00198
[Bug 1196036] Re: V3 Djikstras algorithm Find reachable vertices (origid=X) returns weight=0 instead of weight=count of hops
Found a typo:
=== modified file 'storage/oqgraph/graphcore.cc'
--- storage/oqgraph/graphcore.cc 2013-06-29 13:57:17 +0000
+++ storage/oqgraph/graphcore.cc 2013-08-09 11:20:16 +0000
@@ -823,7 +823,8 @@
EdgeWeight(),
make_dijkstra_visitor(
make_oqgraph_visit_dist(
- boost::make_assoc_property_map(p), d,
+ boost::make_assoc_property_map(p),
+ boost::make_assoc_property_map(d),
static_cast<stack_cursor*>(cursor)
)
),
** Branch linked: lp:~andymc73/oqgraph/10.0-oqgraph3-varchar
--
You received this bug notification because you are a member of OQgraph
developers, which is a bug assignee.
https://bugs.launchpad.net/bugs/1196036
Title:
V3 Djikstras algorithm Find reachable vertices (origid=X) returns
weight=0 instead of weight=count of hops
Status in OQGraph Engine for MariaDB:
Fix Committed
Bug description:
As per http://openquery.com/graph/doc
Dijkstra's shortest path algorithm (latch=1)
Find reachable vertices:
SELECT * FROM foo WHERE latch = 1 AND origid = 1;
Results:
latch, origid, destid are same as input.
vertex id in linkid column.
aggregate of weights in weight column.
INSERT INTO graph_base(from_id, to_id) VALUES (1,2), (2,1);
INSERT INTO graph_base(from_id, to_id) VALUES (1,3), (3,1);
INSERT INTO graph_base(from_id, to_id) VALUES (3,4), (4,3);
INSERT INTO graph_base(from_id, to_id) VALUES (5,6), (6,5);
SELECT * FROM graph WHERE latch='dijkstras' AND origid=1;
latch origid destid weight seq linkid
dijkstras 1 NULL 0 4 4
dijkstras 1 NULL 0 3 3
dijkstras 1 NULL 0 2 2
dijkstras 1 NULL 0 1 1
weight is incorrct, should be 2 1 1 0
To manage notifications about this bug go to:
https://bugs.launchpad.net/oqgraph/+bug/1196036/+subscriptions