loaalgorithmThe OPPA [1]}

[1]

//Initialization part
Input: the statistics of graph \(G(N,E)\)  and the corresponding matrix of the weight of each edges \(\textbf {W}\) .
\(D_{ij}\Leftarrow 0.5\ (\forall E_{ij}\in E,)\)  // Initialize the conductivity of each edge.
\(Q_{ij}\Leftarrow 0\ (\forall E_{ij}\in E)\)  // Initialize the flow of each edge.
\(L_{ij}\Leftarrow W_{ij} (\forall E_{ij}\in E)\)  //The length of the edges equal to their weights.
\(p_i\Leftarrow 0\ (\forall i=1,2,\cdots ,N)\)  // Initialize the pressure at each node.
\(count\Leftarrow 1\)  // Initialize the counting variable.
//Iterative part
\(p_1\Leftarrow 0\)  // The pressure of the starting node (Node 1) is set to 0.
Calculate the pressure of all the nodes using (REF ):
\(\sum _{i\in N}{\frac{D_{ij}}{L_{ij}}(p_i-p_j)=\left\lbrace {\begin{array}{c}+IN_0\ \ for\ j=1, \\-IN_0\ \ for\ j=2, \\0\ \ \ otherwise. \\\end{array}} \right.}\) 
