ON COMPUTER ALGEBRA FOR MST

In this paper we turn our attention to Krushals Algorithm on weighted graphs is one of the basic network optimization problems. Its importance is mainly deu to its application in various areas. Such as commumication and transportation. We present a derivation of Minimum Spanning Tree (MST) lgorithm in environment of maple. the graph section of even the most advensed computer algebra systems such as maple contaion no procedures for direct MSTs algorithm.

کلیدواژه ها:

Computer Algebra ، MST