Get the longest path in a graph with OrientDB -
i'm newbie orientdb , graph (database , concept). want understand how find longest path in graph.
this graph:
the shortest path is: 13:0 -> 13:1 -> 13:2 (with sst() or dijkstra())
but want longest: 13:0 -> 13:3 -> 13:1 -> 13:2
how can do? must create scratch new function?
thanks in advance
luis
you're asking solution np-hard problem :) see here.
Comments
Post a Comment