find shortest path without specifying predicates

[omurbekjk]

How to find shortest path between two nodes ignoring any edge/route between them?
Example:

{
 path as shortest(from: 0x2, to: 0x5) {
  friend # here??? 
 }
 path(func: uid(path)) {
   name
 }
}

more ex: A->B->C->D, A->C->D
find shortest path between A and D should return A->C->D

[pawanrawal]

You need to specify the intermediate nodes for now. Though I think we could make that optional given that we store the list of outgoing predicates from a uid.

[armaneous]

@pawanrawal I think there are some real use-cases where someone would need to know whether there exists any relationship from A to D and if it exists what the shortest path is.

[jimanvlad]

I’m in agreement to the above. There are situations where you wouldn’t easily know the intermediary node.

On Fri, 30 Mar 2018 at 23:37, Andrew Armaneous ***@***.***> wrote: @pawanrawal <https://github.com/pawanrawal> I think there are some real use-cases where we need to know whether there exists any relationship from A to D and if it exists what the shortest path is. — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub <#2265 (comment)>, or mute the thread <https://github.com/notifications/unsubscribe-auth/ACKSZhFVy1NWM9byflwah6rGxu5Fk3R6ks5tjrOugaJpZM4S8TfH> .

-- Thanks, Vlad

[armaneous]

@pawanrawal Is there any update to whether or not something like this will be included in the roadmap?

How do I get the list of outgoing predicates from a uid?

[pawanrawal]

@pawanrawal Is there any update to whether or not something like this will be included in the roadmap?

Sure, it is on the roadmap and would be done soon.

How do I get the list of outgoing predicates from a uid?

You can get the list of outgoing predicates from a uid using _predicate_.

[omurbekjk]

@pawanrawal Just to clarify, right now there is no distinction between node property and edge and everything is predicate in dgraph right? Can we say dgraph supports property graph? Because property graph has properties and edges between nodes.

[armaneous]

@pawanrawal _predicate_ returns all predicates, not necessarily just the ones that are edges, correct? Is there way to just get the edges?

On that note, is there any way to filter on predicates (not on predicate values)?

[pawanrawal]

Nope, there isn't yet a way to filter on the predicate names.