osrm-backend/include/partition/inertial_flow.hpp

#ifndef OSRM_PARTITION_INERTIAL_FLOW_HPP_
#define OSRM_PARTITION_INERTIAL_FLOW_HPP_

#include "partition/dinic_max_flow.hpp"
#include "partition/graph_view.hpp"

namespace osrm
{
namespace partition
{

DinicMaxFlow::MinCut computeInertialFlowCut(const GraphView &view,
                                            const std::size_t num_slopes,
                                            const double balance,
                                            const double source_sink_rate);

} // namespace partition
} // namespace osrm

#endif // OSRM_PARTITION_INERTIAL_FLOW_HPP_
Initial Skeleton for Recursive Bisection via Inertial Flow 2017-01-23 05:50:03 -05:00			`#ifndef OSRM_PARTITION_INERTIAL_FLOW_HPP_`
			`#define OSRM_PARTITION_INERTIAL_FLOW_HPP_`

Optimise Flow Algorithm/Datastructures in use 2017-01-26 04:34:01 -05:00			`#include "partition/dinic_max_flow.hpp"`
Initial Skeleton for Recursive Bisection via Inertial Flow 2017-01-23 05:50:03 -05:00			`#include "partition/graph_view.hpp"`
Implement Parallel Spatial-Ordering/Cut Selection Extends explanation for recursive bisection ids Cleans up Bisection State Removes license boilerplate from partitioner config Sorts Spatially and picks Sources and Sinks Uses sets for sources and sinks for now; see how large they will get Runs n cuts in parallel changing the slope and uses the best Clarifies balance <-> ratio naming 2017-01-25 04:42:13 -05:00
Initial Skeleton for Recursive Bisection via Inertial Flow 2017-01-23 05:50:03 -05:00			`namespace osrm`
			`{`
			`namespace partition`
			`{`

Make InertialFlow a function 2017-02-28 19:48:00 -05:00			`DinicMaxFlow::MinCut computeInertialFlowCut(const GraphView &view,`
			`const std::size_t num_slopes,`
			`const double balance,`
			`const double source_sink_rate);`
Initial Skeleton for Recursive Bisection via Inertial Flow 2017-01-23 05:50:03 -05:00
			`} // namespace partition`
			`} // namespace osrm`

			`#endif // OSRM_PARTITION_INERTIAL_FLOW_HPP_`