ShortestPathDijkstra

[shivarajmulimani]

I tried running the graph algorithms like below

Q1. for below script I am getting cost as infinite and path as [], what does it mean?

starting[] <- [['user1']] 
goal[] <- [['user2']] 
 ?[starting, goal, cost, path] <~ ShortestPathDijkstra(*realtions[startnode, endnode, weight], starting[], goal[])

Q2. I tried running the below algorithm
?[starting, goal, cost, path] <~ KShortestPathYen(*realtions[startnode, endnode, weight], starting[], goal[], k:9)
and encountered below error, how to avoid it?
hread '<unnamed>' panicked at 'index out of bounds: the len is 0 but the index is 0', cozo-core/src/fixed_rule/algos/yen.rs:149:29 PanicException: index out of bounds: the len is 0 but the index is 0

[zh217]

Infinite cost means that the goal isn't reachable. For your second question (and maybe the first as well), would you like to share the data in your relation? Panic means something wrong in the implementation, but without the data we cannot determine the problem.

[shivarajmulimani]

If goal isn't reachable then why it's returning infinite, it could have returned empty list as I see in other cases where there is no path it's returning me empty list.
Sure I will share some example data.