DiscretePath 4+

'DiscretePath' is software for drawing, visualizing and analyzing medium-sized graphs (networks). Graphs of up to 20,000 edges (links) can be drawn in a reasonable amount of time. Larger graphs can also be imported and drawn, but this takes longer. Most analyzes can be performed on larger graphs, except when non-polynomial algorithms are used (for example, clustering using random walks).
From version 2.4.0 an 'Artificial Intelligence' module has been added. This module covers A.I. algorithms that use graphs in some form. The first supervised learning A.I. algorithms that are covered are: "Decision Trees". The decision tree algorithms can handle both categorical and numerical data and can be used for both classification and regression tasks.
At https://www.intrinsic-code.eu you will find the 'User's Guide' which visually explains how to use the software, as well as additional information and background on the many software functions and algorithms used in the analyses.