 the richest nodes, as well as the weakest nodes, deviate from this trend , and exhibit a saturation behaviour arising from the finiteness of semantic possibilities in the network. To preserve uniqueness of operations in the network, the nodes obey an "exclusion principle", with no two nodes being exactly alike in their functionality. The parameters related to finite-size behaviour make a quantitative distinction between the two directed networks of incoming and outgoing links . Dynamic evolution , over two generations of free software releases , shows that the saturation properties of the in-directed and out-directed networks are oppositely affected .
<clarity>  the richest nodes, as well as the weakest nodes, deviate from this trend , and exhibit a saturation behaviour arising from the finiteness of semantic possibilities in the network. To preserve uniqueness of operations in the network, the nodes obey an "exclusion principle", with no two nodes being exactly alike in their functionality. The parameters related to finite-size behaviour make a quantitative distinction between the two directed networks of incoming and outgoing links . Dynamic evolution , over two generations of free software releases , shows that the saturation properties of the in-directed and out-directed networks are oppositely affected .
 the richest nodes, as well as the weakest nodes, deviate from this trend and exhibit finite-size behaviour make a quantitative distinction between the two directed networks of incoming and outgoing links . Dynamic evolution , over two generations of free software releases , shows that the saturation properties of the in-directed and out-directed networks are oppositely affected .