CUDA implemented PUSH RELABEL solves the overall schedule?

I am trying to find some open source code that Goldberg push and drop, or drag, preflop relabel to slice graphs for GENERAL graph.

I know that CUDA has npp GrabCut 2D example code, and I also know that nppiGraphCut () solves the plot for a 2D plane where every pixel is treated as a node. HOWEVER, I want something that solves, given the following plot inputs:

source, sink, number of nodes, from nodes to nodes, forward arc weights (from → to nodes) back weight (to → from nodes) source weight (source for nonterminal nodes) (nonterminal nodes to reduce power)

I have this in matlab, so the following graph is shown where source connects to nodes <1 <2 <3> with sourceWeights, and nodes <1 <2 <3> connect to sink node using sinkWeights. And also there are nodes between the tanks, but only connected in one direction (i.e., the reverse capacitance is 0).

                <source>

      

        
        
        
      

    

<1> → <2> → <3> → <4> → <5> - <6> ... <

                 <sink>

      

        
        
        
      

    

Can this be used in nppGraphCut as a 1D array (<1 <2> <3>) to slice the graph?