Use better permute (less memory, faster)

.github/workflows/npm-publish.yml

@@ -31,17 +31,3 @@ jobs:
       - run: npm publish
         env:
           NODE_AUTH_TOKEN: ${{secrets.npm_token}}
-
-  publish-gpr:
-    needs: build
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v2
-      - uses: actions/setup-node@v1
-        with:
-          node-version: 12
-          registry-url: https://npm.pkg.github.com/
-      - run: npm ci
-      - run: npm publish
-        env:
-          NODE_AUTH_TOKEN: ${{secrets.GITHUB_TOKEN}}

README.md

@@ -11,7 +11,7 @@ For more information read: https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_
 The package implements three functions returning
 
 - the shortestPath between two nodes
-- the shortestPath visiting all nodes in a list (in any order)
+- the shortestPath visiting all nodes in a list (in any order). This operation is quite slow for a long list of nodes (>10), since it evaluates all permutations.
 - the shortest distance between two nodes
 
 Undirected graphs are supported by passing false as the second parameter to the constructor. In this case, for each edge passed to the constructor its symmetric edge is also added to the graph.