We have some path finding stuff in the ``path-finding`` vocabulary, as well as some directed graph stuff in ``graphs`` vocabulary that is used by the compiler.
On Mon, Dec 10, 2018 at 11:43 AM Alexander Ilin <ajs...@yandex.ru> wrote: > Hey, guys! > > I have a new task, and I want to know if there are existing vocabs that > can be employed for solving it. > > Let's say there are versions of a DB format, and there are quotations > that can be executed to convert DB from one version to another. A bunch of > these quotations are edges of a directed graph, and DB versions are nodes. > The task is to find the shortest path in the graph (meaning with the > smallest number of edges), or to declare that the path does not exist. > > Do we have a vocab that could be employed for the path-finding task? > > ---=====--- > Александр > > > > _______________________________________________ > Factor-talk mailing list > Factor-talk@lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/factor-talk >
_______________________________________________ Factor-talk mailing list Factor-talk@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/factor-talk
