1SMALLWORLD(1) DOSE Tools SMALLWORLD(1)
2
3
4
6 smallworld - compute detailed statistic about the dependency graph
7
9 smallworld [option] ... file ...
10
12 smallworld computes detailed statistic about the dependency graph. It
13 accepts
14
16 Currently supported input types are cudf, debian, rpm, opencsw and
17 eclipse. The distcheck tool expects its input specifiations in the form
18 type://pathname where type is one of cudf, deb, synthesis, hdlist, csw
19 or eclipse, and pathname is the pathname of a file containing the
20 input. The package metadata found in that file must correspond to the
21 type given in the URI.
22
24 The output of smallworld is in YAML formar and it is structured as
25 follows :
26
27 Generic Characteristics : Number of vertex and edges of the graph
28
29 Connectivity Properties : The degree of a vertex is the total number of
30 vertices adjacent to the vertex.
31
32 Average Degree : The average degree of a graph G is another measure of
33 how many edges are in set E compared to number of vertices in set V.
34
35 Zero Degree Vertex: The number of vertex that have zero degree.
36
37 Density : The density of a graph G = (V,E) measures how many edges are
38 in set E compared to the maximum possible number of edges between
39 vertices in set V.
40
41 Weakly Connected Components : The weakly connected components are
42 computed by considering the undirected graph of dependencies. This is a
43 useful measure of the number of isolated components in the graph.
44
45 Strongly Connected Components : A a strongly connected component of a
46 directed graph is a subgraph where all nodes in the subgraph are
47 reachable by all other nodes in the subgraph.
48
49 SmallWorld Properties
50
51 Small world graphs are hightly clustered like regular graphs are
52 lacttices, yet they have typically short distances between pair of
53 vertices like in random graphs. The structural properties are
54 quantified by two metrics: the average path length and the clustering
55 coefficient.
56
57 Average Shortest Path Length : The average shortest path is defined as
58 the average number of steps along the shortest paths for all possible
59 pairs of network nodes. The average path length gives the expected
60 distance between two connected nodes.
61
62 Average two step reach : The average two step reach report the likewood
63 of two vertex be be reachable in two steps.
64
65 The network diameter is the largest distance between two nodes. The
66 diameter can also be described as the maximum node eccentricity. The
67 network radius is the minimum among the non-zero eccentricites of the
68 nodes in the network.
69
70 Centrality Properties
71
72 Generic : Vertex : 22311 Edges : 107796 Connectivity : Average Out-
73 Degree : 4.83 Average In-Degree : 4.83 Weakly Connected Components :
74 Number of Components WC : 1425 Average Components WC : 15.66 Larges
75 Component WC : 20831 Strongly Connected Components : Number of
76 Components SC : 22010 Average Components SC : 1.01 Larges Component SC
77 : 77 Small World : Clustering Coefficient : 0.41 Average Shortest Path
78 Length : 3.18 Density : 0.00022 Average two step reach : 14.97
79 Centrality : Centrality Out Degree : 0.00471 Centrality In Degree :
80 0.46787
81
83 -g --generic =item -p --scatterplots =item --combine-scatter =item -c
84 --connectivity =item -m --components =item -s --smallworld =item -e
85 --centrality =item --strong-deps =item --detrans =item
86 --transitive-closure
87 -v Enable info / warnings / debug messages. This option may be
88 repeated up to three times in order to increase verbosity.
89
90 -h, --help
91 Display this list of options.
92
94 smallworld deb:///var/lib/apt/lists/ftp.fr.debian.org_debian_dists_sid_main_binary-amd64_Packages
95
97 Pietro Abate and Jaap Boender
98
100 <http://www.mancoosi.org> is the home page of the Mancoosi project.
101
102
103
104 2023-01-24 SMALLWORLD(1)