title: find the maximum number of vertex-disjoint paths in a graph with a constraint
body: <p>Given a undirected graph G=(V,E), each edge is associated with a non-negative value.</p>
  
  <p>How to find the maximum number of vertex-disjoint paths from s to t on the graph G, with a constraint that the sum of paths length is not greater than a predefined value T.</p>