Hello, I've been using the Dijkstra Source-Target algorithm of the GDSL plugin to get the shortest path between two nodes. That works exactly as it should be, however I always have to rerun the cypher query :
CALL gds.graph.create( 'graphname, 'node'...
