rar

There are N cities

  • 2014-03-05
  • 4.18KB
  • Points it Requires : 2

There are N cities, numbered 0, 1, ... N-1. The path lengths between each city are stored in a two-bit array a, such as a[i][j] represents the path length between city i and city j. Find the shortest path from a city to the rest of the cities.

unfold

You Might Like

Uploader
sinceyoulove
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×