Method Fork

src/linkgraph/linkgraphjob.cpp:199–211

* Add this path as a new child to the given base path, thus making this path * a "fork" of the base path. * @param base Path to fork from. * @param cap Maximum capacity of the new leg. * @param free_cap Remaining free capacity of the new leg. * @param dist Distance of the new leg. */

 * @param dist Distance of the new leg.
 */
void Path::Fork(Path *base, uint cap, int free_cap, uint dist)
{
	this->capacity = std::min(base->capacity, cap);
	this->free_capacity = std::min(base->free_capacity, free_cap);
	this->distance = base->distance + dist;
	assert(this->distance > 0);
	if (this->parent != base) {
		this->Detach();
		this->parent = base;
		this->parent->num_children++;
	}
	this->origin = base->origin;
}

/**
 * Push some flow along a path and register the path in the nodes it passes if