Dionysis Zindros
Dionysis Zindros
The `.` mark stores the last edited line. You should be able to go to it using the keyboard shortcut backtick-dot. This is a very useful feature because of the...
We understand that the ncdns repo contains just the necessary bundle to fetch the go package. However, if there are missing dependencies, then running `make` pollutes the directory in a...
Making ncdns with a missing pcap dependency produces peculiar errors that are difficult to debug. An error indicating that "pcap is required, please run apt-get such and such" would be...
I am using a Greek locale on iOS. Hence, my amounts are displayed as "2,19" by which 2 integer units and a fraction of .19 units is meant. This is...
This patch introduces the `reduce` algorithm which performs a `dfs` but processes the graph using an arbitrary function accumulator. pre-order and post-order are still supported. DFS has been rewritten using...
This patch changes the behavior of undirected graph functions `inEdges` and `outEdges` to return all the edges. This is in accordance to the relevant mathematical literature where, typically, when discussing...
I would like to ask what the rationale for custom edge functions is. It seems to me that edges are an inherent part of a graph's topology and would be...
The current implementation only includes a way to find single source shortest paths in graphs with positive edges using Dijkstra. It would be useful to have an implementation where this...
ECMAScript 6 provides [features that can make the implementation more readable and maintainable](http://es6-features.org/#ExpressionBodies). Let's consider migrating to it. I would especially prefer to see the use of classes to make...
Given the result of a single-source algorithm like Dijkstra or Bellman–Ford, provide a function which can extract the path from a given source to a given destination. Ideally, we should...