Connecting the brainComputer Science Level 4
Let us assume that in our model, the brain has exactly 70 nodes. What is the minimum number of connections (between distinct nodes) that are needed to guarantee that the graph is connected, no matter what the connections are?
Details and assumptions
- A simple graph, also called a strict graph, is an unweighted, undirected graph containing no graph loops or multiple edges.
- Connected means that there exists a path between every pair of nodes.