[cl-graph-devel] map-shortest-paths questions

[Robin Lee Powell]

So there doesn't seem to be anything like introductory documentation
or a tutorial for cl-graph, so I'm struggling along trying to figure
it out.

It doesn't help that it's been a decade since I needed any graph
theory.  :D

Anyways, two questions:

1.  What is it that map-paths and map-shortest-paths return?
describe claims it's a whole graph, which is quite odd; why don't
they return a list of the results of fn on the found paths, like map
would be expected to do?

2.  What does "shortest path" mean when the depth has been
specified?

-Robin

-- 
Lojban Reason #17: http://en.wikipedia.org/wiki/Buffalo_buffalo
Proud Supporter of the Singularity Institute - http://singinst.org/
http://www.digitalkingdom.org/~rlpowell/ *** http://www.lojban.org/