Hi there, first of all your blog is great. I am currently want to write a Q script to find a shortest path for 2 points on a diagram with some nodes and edges using dijkstra’s algorithm theory. But I do not know how to solve it. Could you write some codes to inspire me? I can email you my diagram if you need it. Appreciate

## 3 Comments:

When x has length 0

q){(all x)and not any x}()

1b

Apologies in advance for my lameness ;)

.q.and:{y;1b}

I'll get my coat...

Hi there, first of all your blog is great.

I am currently want to write a Q script to find a shortest path for 2 points on a diagram with some nodes and edges using dijkstra’s algorithm theory. But I do not know how to solve it.

Could you write some codes to inspire me? I can email you my diagram if you need it.

Appreciate

## Post a Comment

Subscribe to Post Comments [Atom]

<< Home