Sum of the min distance from all members v of V (V: set of all vertices of a graph) to any member u of U (U: not a graph, but a set of vertices ie. the vertices need not be connected).
- Doruk Benli
- A. Emre Eser
- Ece Tosun
- Emirhan Özdemir
ecetsn/Distance-to-Set-Computation
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|