dijkstra and floyd----- about graphic algorithm

原创 2006年06月10日 11:17:00

   i would like to use FLOYD since the first experiment which was hold last week.

   The professor gave us  a question, about graphic algorithm:

    Select a position among a certain number of villages to build a hospital, requesting it's the shortest path between the farthest village and the hospital.

    the solvement in our book published by qinghua university is very vivid and easy to learn.

相关文章推荐

Data Structures and algorithm analysis—1.1 What's the book about? (数据结构1.1—关于本书)

CHAPTER 1: INTRODUCTION第一章:简介In this chapter, we discuss the aims and goals of this text and briefly...

Statistics about Hadoop and Mapreduce Algorithm Papers

Underneath are statistics about which 20 papers (of about 80 papers) were most read in our 3 previ...

最短路径算法——Dijkstra and Floyd算法

最短路径算法——Dijkstra算法         Dijkstra 算法在刚开始在学数据结构的时候,完全没弄明白,主要是也不怎么想去弄明白。而从学校出来到现在,最短路径算法都没有实际运用过,最近...
  • chaiqi
  • chaiqi
  • 2012年04月08日 17:13
  • 936

dijkstra,Floyd

  • 2015年03月16日 14:28
  • 5.47MB
  • 下载

Boxshots And Ecover Graphic Software

Turn Up Your Speakers for This Short 6 Minute Video Create Stunning Graphics In Under 2 Minut...

Dijkstra,Floyd,Prim算法c++代码

  • 2011年12月02日 13:08
  • 3KB
  • 下载

floyd warshall algorithm in matlab

  • 2017年04月23日 16:18
  • 1KB
  • 下载

[转] Android Graphic : apk and Skia/OpenGL|ES

本文转自CSDN博客,转载请标明出处:http://blog.csdn.net/yili_xie/archive/2009/11/12/4803565.aspx Android apk 里面的画图分为...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:dijkstra and floyd----- about graphic algorithm
举报原因:
原因补充:

(最多只允许输入30个字)