title: Visiting edges, vertices in an undirected graph
body: <p>Problem: You have an Undirected graph <code>G = (V, E)</code> (V = vertices, E = edges) and you must visit each vertex and pass each edge in both directions.</p>
  
  <p>The only algorithms I know for graphs are DFS, BFS, and a few MST's (Kruskal, etc.) My friend and I were discussing this problem, if it were directed I would simply DFS, and then DFS the transpose but the graph is unfortunately undirected. My friend proposed we perform an MST and DFS the MST and then find the remaining edges by iterating through those that arent in MST. I sort of see what he means but I am not sure this is a good approach? opinions? Also, how would I be able to pass by an edge in both directions if it is undirected?</p>