• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

刘文海 (刘文海.) [1] | 徐荣聪 (徐荣聪.) [2]

Abstract:

最短路径问题是图论中一个非常有实际意义的问题,在实际生活中的各种规划设计问题中及数据挖掘中都有重要的作用。本文着重介绍了用计算机编程语言实现单源最短路径算法与每对结点间的最短路径算法,并作了简单比较。

Keyword:

Bellman Dijkstra Floyd-Warshall Johnson Relax 有向无环图上的最短路

Community:

  • [ 1 ] 福建对外经济贸易职业技术学院
  • [ 2 ] 福州大学数学与计算机科学学院 福建福州350016
  • [ 3 ] 福建福州350002

Reprint 's Address:

Email:

Show more details

Related Keywords:

Related Article:

Source :

福建电脑

Year: 2008

Issue: 02

Page: 9,20

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 3

Affiliated Colleges:

Online/Total:89/10011211
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1