Report copyright - TEDI: Efficient Shortest Path Query Answering on Graphs · 2-HOP approach: pre-compute the transitive closure, so that the reachability queries can be more efficiently answered comparing
Please pass captcha verification before submit form