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: enter image description here

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

Popular posts from this blog

c# - Validate object ID from GET to POST -

node.js - Custom Model Validator SailsJS -

php - Find a regex to take part of Email -