  					nd -> DIST = 1;
  				}
  				else nd -> parent = NULL;
-@@ -712,7 +716,7 @@ class CV_Fast_PD
+@@ -712,7 +716,7 @@
  			for( i = source_nodes_start1; i >= 0; )
  			{
  				Graph::node *n = &_nodes[i];

 		if (bottleneck > a->r_cap) bottleneck = a -> r_cap;
 	}
 	if (bottleneck > - i->tr_cap) bottleneck = - i -> tr_cap;
@@ -121,13 +123,13 @@ void Graph::augment(arc *middle_arc)
 	for (i=middle_arc->sister->head; ; i=a->head)
 	{
 		a = i -> parent;

 
 	typedef void * node_id;
 
@@ -202,7 +207,7 @@
 	Block<arc>			*arc_block;
 	DBlock<nodeptr>		*nodeptr_block;
 
