edmonds_optimum_branching<true, false, false>(G,
vertex_indices,
weights,
static_cast<Vertex *>(0), //Is this conversion to an empty iterator ?
static_cast<Vertex *>(0),// or is this conversion to an iterator pointing to vertex 0, the first node?
std::back_inserter(branching));
If I understand correctly, roots_begin and roots_end are both NULL (?) and hence the problem is solved with no prespecified roots.
What would change suppose I have a graph with 50 vertices, and I want vertex 5 to serve as the root node?
Hello,
The example provided at
https://github.com/atofigh/edmonds-alg/blob/master/doc/examples/sparse-example.cpp
calls the algorithm thus:
If I understand correctly, roots_begin and roots_end are both NULL (?) and hence the problem is solved with no prespecified roots.
What would change suppose I have a graph with 50 vertices, and I want vertex 5 to serve as the root node?
Should the two arguments be:
This, however, shows a compile time error over the
static_cast
as an invalid type conversion of an int.Should the two argument just be:
This, however, does not compile either with the error:
Any guidance is appreciated. Thanks.