title: minimum RGB path
body: <p>You are given a <em>directed</em> graph <code>G = (V, E)</code> <em>weighted edges</em>. Nodes are colored red, green and blue.
  A path from <strong>s</strong> to <strong>v</strong> is called colorful if it contains red green and a blue node. </p>
  
  <p>find the shortest path between <strong>s</strong> and every <strong>v</strong>, in condition that the path should be colorful.
  If there is more than one path that is colorful find the minimum between them.</p>
  
  <p>If there is no such a path return false.</p>
  
  <p>I'm not sure how to get started on this. Any help is greatly appreciated!</p>