DiscretePath

- A cluster algorithm based on 'Random walk' is added. This clustering algorithm provides an additional tool to identify clusters of vertices in a graph. Palette window -> tab 'Calculate' -> Section 'Graph clustering'.
- In the 'Info' tab, the vertices and edges can always be selected (even if they are shown as a result of a calculation).
- Drawing a graph and organizing the graph into groups and clusters has been further optimized: in the past some drawing combinations were not possible.
- In a 'random walk' without a 'predefined' end point, the weight of the edges can be included in the calculations.
- The random walk algorithm has been improved (better coverage of the graph).