**Visualize**

- Draw a network manually
- Draw a network as a graph, as a traditional tree or as radial tree
- Import network data as a list of edges, as an adjacency list, or as an adjacency matrix
- Import x,y-coordinates of the vertices * (f.ex. vertices that represent locations on a map can be set to their latitude and longitude coordinates)
- Open a network file made in DiscretePath (.gdp extension)
- Categories can be assigned to vertices *
- Vertices can be organized in groups (improves graph layout, visualization and analysis) *
- Many options to modify the layout of a network, of the vertices and edges
- The option is available to display grid lines in the canvas.

*** Only available in** **DiscretePathPLUS **

**Analyze**

- Shortest path
- Longest path
- Maximum flow through the edges
- Maximum flow through both the edges and vertices
- Minimum s-t cut
- Global minimum cut
- Minimum spanning tree
- Degree centrality
- Betweenness centrality (vertex and edge betweenness)
- Closeness centrality
- Clustering (based on ‘nearest neighbor’ and ‘random walk’)
- Crossing of edges (only suitable for smaller graphs)
- Random graphs can be created (for example, these can be used as an analysis tool)
- Random walk

*Networks up to 15,000 edges (the number of vertices has less impact) can be imported, visualized and analyzed within a reasonable amount of time. It is possible to work with larger networks (f.ex. 40,000 edges and about 10,000 vertices), but the visualization of these very large networks takes some time.*

**General**

- Export a network as a ‘.txt’ or as a ‘.csv’ file
- Layout preferences: user and network specific
- Backups are made before calculations or when changes in the overall layout are made
- Full featured undo/redo
- Zoom function
- Search function
- DiscretePath is available for MacOS and Windows
- and ………. much more

To explore the features of DiscretePath consult the user guide (User guide)

Go to Welcome page