title: Bidirectional Search on undirected, weighted graph
body: <p>I am new to graph theory, and my question is whether I can implement <code>Bidirectional Search</code> on an undirected, <strong>UN-UNIFORM</strong> weighted graph (I want to find the minimum cost path between two vertices). The weight between vertices is almost always different (number between 1-100) and I read that the Bidirectional Search is only optimal with <strong>UNIFORM</strong> cost paths (or weights), which for me is not the case.
  Thanks for your time.</p>