Version 2.0.9 The user manual covers the features and functionality of the software.
Version 2.0.9 This is a shortened version of the User Guide that contains the essentials for working with DiscretePath.
This is a living document that discusses some of the algorithms used in DiscretePath. Over time, more algorithms will be included. It is important to understands how the algorithms work to interpret the results.
Remark: DiscretePath has a mathematical origin using the terminologies graph, vertex and edge. Networks are identical to graphs. The term network is often used to refer to real systems as a computer network, the world wide web, Facebook, …. A network consist of nodes (identical to vertices) and links (identical to edges).
Go to the Welcome page