Editing Network topology (section)

====Fully connected network====
[[File:NetworkTopology-FullyConnected.png|thumb|Fully connected mesh topology]]

In a ''fully connected network'', all nodes are interconnected. (In [[graph theory]] this is called a [[complete graph]].) The simplest fully connected network is a two-node network. A fully connected network doesn't need to use [[packet switching]] or [[Broadcasting (networking)|broadcasting]]. However, since the number of connections grows quadratically with the number of nodes:

<math>c= \frac{n(n-1)}{2}.\,</math>

This makes it impractical for large networks.  This kind of topology does not trip and affect other nodes in the network.