Topological Ordering on Interval Type-2 Fuzzy Graph

The topological ordering for graphs has many practical applications where the nature of the stated problem requires sequential processing. It might be linking and loading problems, planning and scheduling algorithms, assembly line processing and many other practical applications where precedence constraints are met. Sequencing of vertices execution usually depends on problem and can be represented by directed acyclic graph structure with expert estimations of uncertain variables one can come across. Difficulties in ordering and scheduling vertices of such fuzzy-estimated weighted graph are investigated in this paper. An algorithm for topological ordering and directed minimum spanning tree problem of interval type-2 fuzzy graph for scheduling problem is developed.