title: Found an algorithm that returns all nodes
body: <p>in directed graph, each edge has a color C(e)ϵ{1,2,…k}
  Found an algorithm that returns all nodes that are on circle traversal
  Containing at least one edge of each color.</p>
  
  <p>i think it related to SCC algorithm, but i didnt know how to start </p>
  
  <p>any ideas that can help me? </p>