News for hackers. Stuff that matters.
Re:Network topologies for large-scale compute centers: It's ... by SilasX on Wednesday September 19, 2018 @06:16PM (#18028101)
PSA: in graph theory, the diameter of a network is the length of the longest shortest-path between any pair of nodes. (i.e., out of all the shortest paths between any pair of nodes, return the longest.)

It’s a natural generalization of its definition for circles because, if you modeled a disk as abitrarily many nodes that connect to their immediate neighbors, the definitions would be equivalent.

Not sure if this is too well known to post.

There are no comments on this comment yet.