期刊文献+

基于DAG的高校培养计划图自动生成算法

Automatically generation algorithm of training program graph of university based on DAG
下载PDF
导出
摘要 提出了基于有向无环图的构图和绘图算法,可完成课程拓扑关系图的自动绘制,并以C#为编程语言实现了该算法,最后通过实例验证了算法能直观地表现课程及其间拓扑关系效果,且运行界面整齐美观。 A new method to create and draw graph based on directed acyclic graph algorithm is put for ward. It can draw automatically curricular topological relation diagrams, and it is realized with C# language program. At last, the instance verifies the algorithm's effect that can visually display curricula and their topol ogical relationship, and its interface is orderly and beautiful.
作者 余冬梅
出处 《陕西理工学院学报(自然科学版)》 2013年第5期35-38,共4页 Journal of Shananxi University of Technology:Natural Science Edition
基金 陕西省教育厅科研基金资助项目(12JK0864)
关键词 有向无环图 高校 培养计划 算法 directed acyclic graph (DAG) university training program algorithm
  • 相关文献

参考文献7

二级参考文献67

  • 1李庆华,阮幼林,刘干,蒋盛益,杨世达.一个调度Fork-Join任务图的最优算法(英文)[J].软件学报,2005,16(5):684-690. 被引量:8
  • 2杜晓丽,蒋昌俊,徐国荣,丁志军.一种基于模糊聚类的网格DAG任务图调度算法[J].软件学报,2006,17(11):2277-2288. 被引量:48
  • 3陈永当,杨海成,杜兵劳.基于本体的航空发动机设计知识组织模型构建与分析[J].航空动力学报,2007,22(1):90-95. 被引量:6
  • 4王生发,顾新建,郭剑锋,马军,战洪飞.面向产品设计的知识主动推送研究[J].计算机集成制造系统,2007,13(2):234-239. 被引量:38
  • 5Furer M, Raghavachari B. An NC approximation algorithm for the minimum degree spanning tree problem [C]//Proc of the 28th Annual Allerton Conf on Communication, Control and Computing. Monticello, IL: Allerton House, 1990: 274-281.
  • 6Agrawal A, Klein P, Ravi R. How tough is the minimumdegree Steiner tree? A new approximate min-max equality, TR CS-91-49 [R]. Providence, Rhode Island: Brown University, 1991.
  • 7Ravi R, Marathe M V, Ravi S S, et al. Many birds with one stone., multi-objective approximation algrorithms [C] //Proc of the 25th Annual ACM Symp on the Theory of Computing (STOC). New York: ACM, 1993:438-447.
  • 8Konemann J, Ravi R. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees [C] //Proc of the 32nd Annual ACM Symp on Theory of Computing(STOC). New York: ACM, 2000:537 -546.
  • 9Ravi R, Raghavachari B, Klein P. Approximation through local optimality: designing networks with small degree [C]// Proc of the 12th Conf on Foundations of Software Tech and Theoret Comp Science (FSTTCS). Berlin: Springer, 1995: 279-290.
  • 10Furer M, Raghavachari B. Approximating the minimumdegree Steiner tree to within one of optimal [J]. Journal of Algorithms, 1994, 17(3): 409-423.

共引文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部