基于遗传算法的圈秩实现

The Realization of the Undirected Graph's Cycle Rank Based on Genetic Algorithms

利用Matlab来求图论中无向图的圈秩.对于出现圈的图,采用关联矩阵进行判断,把构成圈的边删除.基于Matlab在消圈方面算法的可移植性,对当下算法进行适当修改后,形成了直观的无向图的圈秩效果图,并计算出最后的边数.其对电子电路和交通规划的实际问题中,能起到很好的作用.

This paper introduces how to get the undirected graph＇s cycle rank through Matlab. Deleting the undirected graph＇s edge,we use incident matrix to make judgement. Because of the algorithm of Graph decycling mumber can be transplanted,so we modify the algorithm to getting drawing and the rest of the number of edges..This drawing is simple and clear. The article will play to Very good effect on electronic circuit and the practical problems of traffic planning.