Graph Traversals and Spanning Forests
Connected Graph A graph is said to be connected if there is a path between any two of its nodes. Cycle A Path from a node to itself is called a Cycle. A rgaph must require at least 3 nodes to form a cycle. Tree A TreeĀ is a connected graph without cycles. Spanning Forests A…