Andrew McDonnell (andymc73) has assigned this bug to you for OQGRAPH:
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
** Affects: oqgraph
Importance: Undecided
Assignee: OQgraph developers (oqgraph-dev)
Status: New
--
V3 Djikstras algorithm Find reachable vertices (origid=X) returns weight=0
instead of weight=count of hops
https://bugs.launchpad.net/bugs/1196036
You received this bug notification because you are a member of OQgraph
developers, which is a bug assignee.
--
Mailing list: https://launchpad.net/~oqgraph-dev
Post to : oqgraph-dev@lists.launchpad.net
Unsubscribe : https://launchpad.net/~oqgraph-dev
More help : https://help.launchpad.net/ListHelp
