AgensBrowser – find shortestPath

There are many paths on the graph, and finding the path of the lowest weight among them is called the #shortestPathSearch. #Path is a set of relations and means there are the dependency in the case of production lines. #AgensBrowser support #Dijkstra ‘s shortest path algorithm. (weight=# of edges) If you switch on toggle-button, shortest path algorithm work with direction of edges. This function doesn’t spend many time because it works just result graph with your query. #AgensGraph