dilena
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revisionNext revisionBoth sides next revision | ||
dilena [2021/10/12 05:44] – created gda | dilena [2021/10/12 05:45] – gda | ||
---|---|---|---|
Line 6: | Line 6: | ||
DiLeNA is modular and it is composed of two main components: | DiLeNA is modular and it is composed of two main components: | ||
- | * Unordered List Item Graph Generator: it is in charge of downloading the transactions of the examined DLT, generated during the time interval of interest. Then, a directed graph is built, that represents the interactions among the nodes. The vertices of the graph correspond to the addresses in the DLT and, for each transaction, | + | * **Graph Generator**: it is in charge of downloading the transactions of the examined DLT, generated during the time interval of interest. Then, a directed graph is built, that represents the interactions among the nodes. The vertices of the graph correspond to the addresses in the DLT and, for each transaction, |
- | * Unordered List Item Graph Analyzer: this module is in charge of calculating the typical metrics related to the obtained graph. Among the others, the tool is able to measure the degree distribution, | + | * **Graph Analyzer**: this module is in charge of calculating the typical metrics related to the obtained graph. Among the others, the tool is able to measure the degree distribution, |
- | metrics, such as the average shortest path. Moreover, the tool computes if the network is a small world, by comparing it with a corresponding random graph (with the same amount of nodes and edges). | + | |
DiLeNA is available in source code form. | DiLeNA is available in source code form. | ||