Re: [Tcllib-devel] GSoC Graph. Review revision 25

[Michał A. <ant...@gm...>]

I updated new implementations of subprocedures for K-Center.

Thanks for your description regarding creating twosquared graph for K-Center
- very good idea, it frees from using dijkstra and path finding well.

So, there is now procedure extendTwoSquaredGraph, which takes at input graph
G(i-1)**2, graph G(i) and two nodes ( source and target of Ei - edge we are
adding at current iteration ). As I understood, G(i) will be needed to find
proper neighbours, when finding edges with distance == 2, for nodes u and v.

So, creating proper G(i), before extendTwoSquaredGraph goes, will be just
adding new edge Ei.

There is also procedure createSquaredGraph, which counts two-squared graph
from graph G given at input - implemented as you described, without any path
finding algorithms.

About my first implementation, I didn't erased it yet. Actually, I think it
can be useful for creating procedure that count X-Squared graph for graph G
and positive int X given at input, as it would need only adding one param at
input and little changes in a code, if I'm not mistaken. Procedure creating
X-Squared graphs might be useful new graph operation.

Best Regards,
Michal Antoniewski

.