Some sort of small-world network is a sort of mathematical graph where most nodes will not be neighbours of one other, but most nodes might be reached from almost every other by few hops or actions. They noted that graphs may very well be classified according to be able to two independent structural capabilities, namely the clustering coefficient, along with average node-to-node length.
Small-World Network
