N adjacency matrix for n-vertex goat, but you are not told determine values of i and j are. Values of i and j, and labels all vertices according to their type (head, neck, shoulder, hip, front foot or rear foot). Note that as adjacency matrix has n2 entries, you can't scan entire matrix in O(n) time. Describe how algorithm works.