45) An adjacency matrix has a row and column of all zeroes for a node. a) What does the corresponding entry of the adjacency list look like? b) What does the graph of the network look like with respect to this node? 46) Give an example of a network that can be represented by a directed graph 47) What does the phrase 'breadth-first search' mean? How is it used in finding the 48) Give an example of a situation in which finding the shortest path between two 49) What is a 'small-world' network? What property makes a network a small-world shortest path between two nodes in a network? nodes in a network is useful. network