-Rung Orthopair Fuzzy Matroids with Application to Human Trafficking

Algorithm 1

Selection of the heaviest path.

(1)	Input:
(i)	Consider two finite sets of countries and , and each and mark a vertex of the graph .
(ii)	Mark all the edges and give the direction between the countries regarding given -rung orthopair fuzzy information and given problem, that is, for each , represents a directed edge that represents the flow between two countries. There is no edge between any of the ’s and also no edge between ’s.
(2)	Calculate the score function .
(3)	Find all the edge sets of length and remove all the cycles of length .
(4)	Find , where .
(5)	Determine by removing all from such that ’s are not spanning paths (the path runs through each vertex of the graph exactly once).
(6)	Reduce the set to by removing all the spanning paths from which are not the cases according to the directions given in the data.
(7)	Compute where each .
(8)	Find .
	Output: in the last step, the heaviest path will help us to take suitable measures according to flow of human trafficking given in the data.