fixup_graph_d Struct Reference

Collaboration diagram for fixup_graph_d:

Data Fields
int	num_vertices
int	num_edges
int	new_entry_index
int	new_exit_index
fixup_vertex_p	vertex_list
fixup_edge_p	edge_list

---

Detailed Description

Fixup graph used in the MCF algorithm.   

---

Field Documentation

fixup_edge_p fixup_graph_d::edge_list

Referenced by add_edge(), cancel_negative_cycle(), compute_residual_flow(), create_fixup_graph(), delete_fixup_graph(), and find_max_flow().

int fixup_graph_d::new_entry_index

Referenced by cancel_negative_cycle(), create_fixup_graph(), find_minimum_cost_flow(), and print_basic_block().

int fixup_graph_d::new_exit_index

Referenced by create_fixup_graph(), dump_fixup_graph(), find_minimum_cost_flow(), and print_basic_block().

int fixup_graph_d::num_edges

Referenced by add_edge(), cancel_negative_cycle(), compute_residual_flow(), create_fixup_graph(), dump_fixup_graph(), find_max_flow(), and find_minimum_cost_flow().

int fixup_graph_d::num_vertices

Referenced by cancel_negative_cycle(), create_fixup_graph(), delete_fixup_graph(), dump_fixup_graph(), find_augmenting_path(), find_max_flow(), and find_minimum_cost_flow().

fixup_vertex_p fixup_graph_d::vertex_list

Referenced by add_edge(), create_fixup_graph(), delete_fixup_graph(), dump_fixup_graph(), find_augmenting_path(), and find_fixup_edge().

---

The documentation for this struct was generated from the following file:

• mcf.c