Custom Query – LEMON

Results (157 - 159 of 545)

← 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 →

Ticket	Resolution	Summary	Owner	Reporter
#617	invalid	Typo in shared library names: it installs libemon.so	Alpar Juttner	yurivict
Description	1.3.1 installs: lib/libemon.so lib/libemon.so.1.3.1
#619	invalid	Segmentation fault when calling findArc	Alpar Juttner	didif
Description	Found in version: 1.3.1 The call to findArc in the bellow program yields segmentation fault on Ubuntu 16.04: int main() { ListGraph? g; ListGraph::Node n = g.addNode(); ListGraph::Arc a = findArc(g, INVALID, n); return 0; } I expect to get INVALID back from findArc in this case.
#627	invalid	O(1) time to get an arc from node u and node v	Alpar Juttner	zhaofeng-shu33
Description	is there any graph structure in lemon library which supports getting an arc from its two nodes in O(1) times? I check ListDigraph?, by iterating all arcs connected with one node, I can achieve this purpose but it could be O(n).

← 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 →