This module analyzes any type of network. Transportation networks, computer networks, water supply networks and sewage networks are only a few of the possible uses that this module can be given.
2R Net's input data includes:
- Each node's position (given in an arbitrary X/Y coordinate system or in terms of LATITUDE and LONGITUDE).
- Each node's name.
- The network's connectivity matrix (indicating which nodes are directly connected and in what direction).
- The weight matrix, which can be arbitrary or automatically generated based on the distances between nodes.
- The failure probability of each edge and node. The edge failure probability can be calculated based on the distances between nodes and a proportionality factor.
- Capacity and demand matrices (describing the capacity and demand of each link).
 |  |  |  |
2R Net's basic functions include:
- Graphing the network (normal or ring graph modes)
- Exporting data to Microsoft Excel
- Receiving input from Microsoft Excel
 |  |  |
A variety of statistics can be queried for each node. Most importantly, a statistic can be analyzed in terms of a whole network to find its probability distribution, box-whisker graph, etc:
- Betweenness Centrality (normalized)
- Closeness Centrality
- Clustering Coefficient
- Degree Centrality
- Degree In
- Degree Out
 |  |  |  |
The following network-centric algorithms can be run:
- Random network generation
- Basic clustering (K-Medoids, Edge Betweenness, Weak Component and MCL)
- Multi-level clustering (K-Medoids and MCL)
- Shortest paths (Dijkstra, Bellman-Ford and Floyd-Warshall)
- Connectivity tests between two nodes (depth-first and breadth-first)
 |  |  |  |
 |  |  |  |
2R Net's reliability analysis options set it apart from other software suites. All of the reliability algorithms are non-polynomial, so the graphical interface shows the real-time progress of each run and automatically generates convergence graphs where appropriate. A network can be analyzed to find:
- Minimal vertex cut sets using weak, normal and strong connectivity types, either for the entire network or an A-to-B subsystem).
- Minimal edge cut sets using weak, normal and strong connectivity types, either for the entire network or an A-to-B subsystem.
- The K-Vertex and K-Edge connectivity of the network using weak, normal and strong connectivity types.
- The maximum flow of the network and its critical links with the Edmonds-Karp algorithm.
- The failure probability of an A-to-B subsystem using weak, normal and strong connectivity types.
- Graphical representations of the cut sets with link and vertex sizes proportional to the cut set's probability of occurrence.
 |  |  |
|
 |  |  |  |
