manual: Add Single-source Shortest Paths.

This commit is contained in:
Sergiu Ivanov 2022-01-02 22:09:29 +01:00
parent 8499f4eee2
commit 422ab535f8
1 changed files with 9 additions and 0 deletions

View File

@ -171,6 +171,15 @@ Graph properties are not supported.
@defproc[(min-st-prim [g Graph] [source Any]) (Listof (List Any Any))]{} @defproc[(min-st-prim [g Graph] [source Any]) (Listof (List Any Any))]{}
@defproc[(max-st-prim [g Graph] [source Any]) (Listof (List Any Any))]{} @defproc[(max-st-prim [g Graph] [source Any]) (Listof (List Any Any))]{}
@subsection{Single-source Shortest Paths}
@defproc[(bellman-ford [g Graph] [source Any]) (Values (Mutable-HashTable Any Number)
(Mutable-HashTable Any Any))]{}
@defproc[(dijkstra [g Graph] [source Any]) (Values (Mutable-HashTable Any Number)
(Mutable-HashTable Any Any))]{}
@defproc[(dag-shortest-paths [g Graph] [source Any])
(Values (Mutable-HashTable Any Number)
(Mutable-HashTable Any Any))]{}
@section{License} @section{License}
Like the generic graph library, this library is licensed under the Apache Like the generic graph library, this library is licensed under the Apache