This felt useful in class, diameter is the maximum of the minimum routing distance between any two nodes.
paluri
@flyne I think for me it was easiest just to think of it as the distance between the farthest 2 nodes in the graph. Obviously you could make that distance arbitrarily long (which is why your comment is more precise/correct), but I guess I think about the distance between nodes as being defined as the shortest path between those nodes anyway.
mingf
Irregular topology is a network that is not usual. It is usually a mix of multiple topologies and direct and indirect topologies. Sometimes, it is a better choice for a specific application.
This felt useful in class, diameter is the maximum of the minimum routing distance between any two nodes.
@flyne I think for me it was easiest just to think of it as the distance between the farthest 2 nodes in the graph. Obviously you could make that distance arbitrarily long (which is why your comment is more precise/correct), but I guess I think about the distance between nodes as being defined as the shortest path between those nodes anyway.
Irregular topology is a network that is not usual. It is usually a mix of multiple topologies and direct and indirect topologies. Sometimes, it is a better choice for a specific application.