动态规划法在节点编号优化中的应用

APPLYING DYNAMIC PROGRAMMING IN THE OPTIMIZATION OF NODE NUMBER

本文在分析了Cuthill-Mckee节点编号法[1]以后,指出了该方法的缺陷,进而提出了选择最佳边界点,作为网络节点编号(或重新编号)的起点(即序号为1);提出了用动态归划法的思想逐步挑选下一个编点,从而达到节点编号优化目的;结合用有限元素法求解大型结构矩阵时进行节点编号中的需要,对图论中的网络节点有关定义作了适当修改和补充。

This paper analyses the method of Cuthill - Mckee node number (reference document 1),and points out the defect in this method,then raises to select a optimum boundary point as a starting point(i.e.serial number is one)of network node number or renew;The paper also raises to choose the next numb-dred node step by step with the thought of Dynamic programming,So that to achieve the purpose - optimization of node number; Integrate the requiement that use finite element method to get rid of large model structure matrix when numbdring node,the paper do some proper amend and supplementary about the relevant definition to the network rode in graph theory.