|
Flowlessly
0.1
Minimum cost maximum cost solver
|
This is the complete list of members for flowlessly::AdjacencyMapGraph, including all inherited members.
| AddArc(uint32_t src_node_id, uint32_t dst_node_id, uint32_t min_flow, int32_t capacity, int64_t cost, int32_t type) (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | virtual |
| AddNode(uint32_t node_id, int32_t supply, int64_t potential, NodeType type, bool first_scheduling_iteration) (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | virtual |
| AddNode(int32_t supply, int64_t price, NodeType type, bool first_scheduling_iteration) | flowlessly::AdjacencyMapGraph | virtual |
| AdjacencyMapGraph(Statistics *stats) (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | explicit |
| AdjacencyMapGraph(uint32_t max_node_id, uint32_t num_arcs, uint32_t sink_node, const set< uint32_t > &source_nodes, const vector< unordered_map< uint32_t, Arc * > > &arcs, const vector< Node > &nodes, const set< uint32_t > &unused_node_ids, Statistics *stats) (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | |
| ChangeArc(Arc *arc, uint32_t new_min_flow, int32_t new_capacity, int64_t new_cost, int32_t new_type) | flowlessly::AdjacencyMapGraph | virtual |
| ChangeArc(uint32_t src_node_id, uint32_t dst_node_id, uint32_t new_min_flow, int32_t new_capacity, int64_t new_cost, int32_t new_type, bool is_multi_arc, int64_t old_cost) | flowlessly::AdjacencyMapGraph | virtual |
| get_active_node_ids() (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | inline |
| get_admissible_arcs() (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | inline |
| get_arcs() (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | inline |
| get_max_node_id() const (defined in flowlessly::Graph) | flowlessly::Graph | inline |
| get_nodes() (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | inline |
| get_potentials() (defined in flowlessly::Graph) | flowlessly::Graph | inline |
| get_sink_node() (defined in flowlessly::Graph) | flowlessly::Graph | inline |
| get_source_nodes() (defined in flowlessly::Graph) | flowlessly::Graph | inline |
| GetMachinePUs(uint32_t machine_node_id, set< uint32_t > *pu_ids) (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | virtual |
| GetRandomArc(uint32_t node_id) | flowlessly::AdjacencyMapGraph | virtual |
| GetTaskAssignments() (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | |
| GetTotalCost() | flowlessly::AdjacencyMapGraph | virtual |
| Graph() (defined in flowlessly::Graph) | flowlessly::Graph | inline |
| Graph(uint32_t max_node_id, uint32_t num_arcs, uint32_t sink_node, const set< uint32_t > &source_nodes) (defined in flowlessly::Graph) | flowlessly::Graph | inline |
| InitializeGraph() (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | virtual |
| IsEpsOptimal(int64_t eps) | flowlessly::AdjacencyMapGraph | virtual |
| IsFeasible() | flowlessly::AdjacencyMapGraph | virtual |
| IsInTopologicalOrder(const vector< uint32_t > &node_ids) | flowlessly::AdjacencyMapGraph | virtual |
| max_node_id_ (defined in flowlessly::Graph) | flowlessly::Graph | protected |
| MaxRefinePotential(uint64_t node_id, int64_t eps) | flowlessly::AdjacencyMapGraph | |
| num_arcs_ (defined in flowlessly::Graph) | flowlessly::Graph | protected |
| potentials_ (defined in flowlessly::Graph) | flowlessly::Graph | protected |
| ReadGraph(FILE *graph_file, bool first_scheduling_iteration, bool *end_of_scheduling) (defined in flowlessly::Graph) | flowlessly::Graph | |
| RemoveArc(Arc *arc) | flowlessly::AdjacencyMapGraph | virtual |
| RemoveNode(uint32_t node_id) | flowlessly::AdjacencyMapGraph | virtual |
| ScaleDownCosts(int64_t scale_down) | flowlessly::AdjacencyMapGraph | virtual |
| ScaleUpCosts(int64_t scale_up) | flowlessly::AdjacencyMapGraph | virtual |
| sink_node_ (defined in flowlessly::Graph) | flowlessly::Graph | protected |
| source_nodes_ (defined in flowlessly::Graph) | flowlessly::Graph | protected |
| TopologicalSort(vector< uint32_t > *ordered) | flowlessly::AdjacencyMapGraph | |
| UpdateAdmissibleGraph(const vector< uint32_t > &updated_nodes) (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | |
| WriteAssignments(FILE *out_file) | flowlessly::AdjacencyMapGraph | virtual |
| flowlessly::Graph::WriteAssignments(const string &out_file_name) | flowlessly::Graph | |
| WriteFlowGraph(FILE *out_graph_file) | flowlessly::AdjacencyMapGraph | virtual |
| flowlessly::Graph::WriteFlowGraph(const string &out_graph_file) | flowlessly::Graph | |
| WriteGraph(FILE *out_graph_file) | flowlessly::AdjacencyMapGraph | virtual |
| flowlessly::Graph::WriteGraph(const string &out_graph_file) | flowlessly::Graph | |
| ~AdjacencyMapGraph() (defined in flowlessly::AdjacencyMapGraph) | flowlessly::AdjacencyMapGraph | |
| ~Graph() (defined in flowlessly::Graph) | flowlessly::Graph | inlinevirtual |
1.8.6
