I have hacked in support for weighted nodes into Prim's algorithm, where the weight is accounted for if a node is supposed to be added. This allows to extend a one-tree towards a TSP approximation.
Sometimes weighted nodes can be achieved by graph transformations into weighted edges as for flow algorithms, but this is not always possible (e.g. for Prim where I do not see this possibility). I would like to know if there is interest in weighted node support? I can add it properly and open a PR, but I thought somebody might have further insight into this...
I have hacked in support for weighted nodes into Prim's algorithm, where the weight is accounted for if a node is supposed to be added. This allows to extend a one-tree towards a TSP approximation.
Sometimes weighted nodes can be achieved by graph transformations into weighted edges as for flow algorithms, but this is not always possible (e.g. for Prim where I do not see this possibility). I would like to know if there is interest in weighted node support? I can add it properly and open a PR, but I thought somebody might have further insight into this...