Skip to content

DiscretePath

Understanding networks

Menu
  • Home
  • Features
  • Screenshots
  • Software
  • User guide
  • Resources
  • Contact
  • Version history
  • Privacy Policy
  • Checkout-Result

User guide

Icon

DiscretePath User Guide

1 file(s) 62 MB
Download
Version 2.3.0
The user manual covers the features and functionality of the software.
Icon

Using vertex categories and groups

1 file(s) 22.2 MB
Download
Vertex categories and groups in DiscretePath
Vertices belonging to the same category are similar to each other based on certain conditions, such as lipids in biochemistry and gender in social networks. 'Groups' allow for a better organization of a graph and more efficient visualization and analysis.
Icon

Some clarification about the graph algorithms used in DiscretePath

1 file(s) 8 MB
Download
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

DiscretePath 2023 . Powered by WordPress