1 0 0</pre>
<p>The file above represents graph <strong>G<sub>1</sub></strong> from today's notes. The first line tells us how many nodes there are in the graph, <em>n</em>, which allows us to create an appropriately sized grid to store our adjacency matrix. The next&nbsp;<em>n</em> lines give labels or names to our nodes. Those can be stored in a vector for ease of reference. The final&nbsp;<em>n</em> lines give us an adjacency matrix. The first of those final&nbsp;<em>n</em> lines tells us which nodes have