solvr 0.2.0

Advanced computing library for real-world problem solving - optimization, differential equations, interpolation, statistics, and more
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

//! CUDA implementation of network flow algorithms.

use crate::graph::impl_generic::{max_flow_impl, min_cost_flow_impl};
use crate::graph::traits::flow::FlowAlgorithms;
use crate::graph::traits::types::{FlowResult, GraphData, MinCostFlowOptions};
use numr::error::Result;
use numr::runtime::cuda::{CudaClient, CudaRuntime};

impl FlowAlgorithms<CudaRuntime> for CudaClient {
    fn max_flow(
        &self,
        graph: &GraphData<CudaRuntime>,
        source: usize,
        sink: usize,
    ) -> Result<FlowResult<CudaRuntime>> {
        max_flow_impl(self, graph, source, sink)
    }

    fn min_cost_flow(
        &self,
        graph: &GraphData<CudaRuntime>,
        source: usize,
        sink: usize,
        options: &MinCostFlowOptions,
    ) -> Result<FlowResult<CudaRuntime>> {
        min_cost_flow_impl(self, graph, source, sink, options)
    }
}