Topological sorting method of interval number complementary judgment matrix

The concepts of superiority and inferiority are introduced. By constructing a directed graph corresponding with the interval number complementary judgment matrix, the ranking problem of interval number complementary judgment matrix is transformed into the problem of topological sorting of the directed graph. The method of exporting the nodes in the directed graph according to the importance sequence of the alternatives is given. The sequence of the nodes is corresponding to the importance order of the alternatives. The numerical example is presented to demonstrate the effectiveness and feasibility of the technique.