Finish the s-t cut lister algorithms

Bug #651928 reported by Gábor Csárdi on 2010-09-30
This bug affects 1 person
Affects Status Importance Assigned to Milestone
Gábor Csárdi

Bug Description

Things to do:
- igraph_even_tarjan_reduction, use proper Inf instead of no_of_nodes, otherwise it does not work for weighted graphs.
- igraph_i_dominator_compree always reallocates 'path'
- implement the faster dominator tree finder, this is not actually needed for cohesive blocks.
- error handling in igraph_i_all_st_cuts_minimal_dfs_incb
- igraph_i_all_st_cuts_minimal could return the minimal elements in GammaX
- igraph_i_all_st_cuts_pivot could use adjacency lists, instead of calling neighbors continuously. If it is worth at all.
- implement a non-recursive version of igraph_provan_shier_list.
- simplify igraph_i_all_st_mincuts_pivot by not creating Sbar explicitly.
- some other minor bits, search for TODO in st-cuts.c

Changed in igraph:
importance: Undecided → Medium
status: New → Confirmed
assignee: nobody → Gábor Csárdi (gabor.csardi)
Gábor Csárdi (gabor.csardi) wrote :

These are not crucial now.

Changed in igraph:
milestone: none → 0.7

The development of igraph has moved to github, so please do not comment on this bug here. You are of course welcome to comment on github, here:

To post a comment you must log in.
This report contains Public information  Edit
Everyone can see this information.

Other bug subscribers