OpenTTD Source 20241224-master-gf74b0cf984
mcf.h
Go to the documentation of this file.
1
3#ifndef MCF_H
4#define MCF_H
5
6#include "linkgraphjob_base.h"
7
8typedef std::vector<Path *> PathVector;
9
14protected:
20 max_saturation(job.Settings().short_path_saturation)
21 {}
22
23 template<class Tannotation, class Tedge_iterator>
24 void Dijkstra(NodeID from, PathVector &paths);
25
26 uint PushFlow(Node &node, NodeID to, Path *path, uint accuracy, uint max_saturation);
27
28 void CleanupPaths(NodeID source, PathVector &paths);
29
32};
33
50private:
51 bool EliminateCycles();
52 bool EliminateCycles(PathVector &path, NodeID origin_id, NodeID next_id);
53 void EliminateCycle(PathVector &path, Path *cycle_begin, uint flow);
54 uint FindCycleFlow(const PathVector &path, const Path *cycle_begin);
55public:
57};
58
67public:
69};
70
75template<class Tpass>
77public:
78
83 void Run(LinkGraphJob &job) const override { Tpass pass(job); }
84};
85
86#endif /* MCF_H */
A handler doing "something" on a link graph component.
Class for calculation jobs to be run on link graphs.
First pass of the MCF calculation.
Definition mcf.h:49
bool EliminateCycles()
Eliminate all cycles in the graph.
Definition mcf.cpp:481
uint FindCycleFlow(const PathVector &path, const Path *cycle_begin)
Find the flow along a cycle including cycle_begin in path.
Definition mcf.cpp:360
void EliminateCycle(PathVector &path, Path *cycle_begin, uint flow)
Eliminate a cycle of the given flow in the given set of paths.
Definition mcf.cpp:377
Second pass of the MCF calculation.
Definition mcf.h:66
Link graph handler for MCF.
Definition mcf.h:76
void Run(LinkGraphJob &job) const override
Run the calculation.
Definition mcf.h:83
Multi-commodity flow calculating base class.
Definition mcf.h:13
MultiCommodityFlow(LinkGraphJob &job)
Constructor.
Definition mcf.h:19
void Dijkstra(NodeID from, PathVector &paths)
A slightly modified Dijkstra algorithm.
Definition mcf.cpp:257
LinkGraphJob & job
Job we're working with.
Definition mcf.h:30
uint max_saturation
Maximum saturation for edges.
Definition mcf.h:31
uint PushFlow(Node &node, NodeID to, Path *path, uint accuracy, uint max_saturation)
Push flow along a path and update the unsatisfied_demand of the associated edge.
Definition mcf.cpp:344
void CleanupPaths(NodeID source, PathVector &paths)
Clean up paths that lead nowhere and the root path.
Definition mcf.cpp:312
A leg of a path in the link graph.
Some typedefs for component handlers.
Node of the link graph.
Definition linkgraph.h:90