Re: [Tcllib-devel] Graphops - Documentation (fwd)

[Andreas K. <and...@ac...>]

Michał Antoniewski wrote:
> I've got one more question about documentation.
>  
> As during implementation, there were created some subprocedures (for 
> main algorithms) that can be found useful as individual graph 
> operations, I would like to verify which of them should be put in 
> documentation :
>  
> a) Algorithms:
> - Greedy Max Matching - subprocedure for Christofides but 
> still individual algorithm, so I think can be included.
> - Greedy Max Independent Set (Weighted also) - the same as above.
> - BFS and BFS pathfinding - I think both BFS procedures will be useful 
> addition.

Yes to all.

>  
> b) some other graph operations:
> - create squared graph - possibly useful graph operation.
> - create Complete Graph - for input graph G, adds missing edges and 
> returns complete graph. 
> - copy Graph - subprocedure for copying graphs as there are a lot of 
> such uses in implementation. Possibly useful operation for users too.
> Generally subprocedures under "b)" are less likely to add in graphops 
> than "a)" and "c)", but I'm asking to make sure.

Yes to all. Copying graph definitely occurs often, and all not quite able to 
use the (de)serialize methods because of changes to attributes, and/or arc 
names, and the like.

> c) Subprocedures considering flow problems. Also useful as individual 
> procedures:
> - create Residual Graph
> - create Augmenting Network
> - create Level Graph

Yes.

Andreas.