Unformatted text preview: You may assume the graph has no parallel edges. (i) Output the degree of each node, where the degree counts the number of edges that are connected to the node. (By convention, when a node is connected to a self-loop, the edge contributes 2 to the node’s degree.) (ii) For an arbitrary node j and node k , determine if there is a path that connects node j to node k ....
View Full Document
This document was uploaded on 06/13/2011.
- Summer '09
- Computer Science