This is the problems I am trying to solve:
Given an undirected graph, find the number of different unordered combinations of nodes that can be obtained by traversing
