Let me rephrase the question: Is it possible to select a ShortestPath from a graph where edges have a specific edge property?
On Saturday, November 21, 2015 at 1:42:02 PM UTC-3, Ricardo A. Pasquini wrote: > > Hi Orientdb community, > I have a graph with dates as propertys in the edges. In my case, for > instance, I have employees and companys as vertices, and an edge class (say > Workin) represents that an employee X works in company Y since a specific > date. For instance: > > Employee X-> Workin (since May 2010)> Company Y > > I am studying how the paths have evolved in time. I am interested in a > historical analysis of the network. Precisely I would like to compute > shortest paths in my graph by restricting the edges to certain dates. > I am aware that the ShortestPath function allows traversing edges only > from a specific class, but not filtering edges with a certain condition in > their properties. Is there a way to do this? > > I have thought two possible solutions but I am not happy yet with either > of them. One is to create involving only the relationships I am interested > for certain dates. However, I do not know here how to easily assign a set > of edges to a new class. It will also have the cost of having a high number > of classes for the dates I am interested in. > The other solution I thought is to play with the dijkstra() function, > giving extremely high values to certain edges when in reality they do not > exist. > I was wondering if any of you could > Thanks in advance > Ricardo > -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
