合肥生活安徽新聞合肥交通合肥房產生活服務合肥教育合肥招聘合肥旅游文化藝術合肥美食合肥地圖合肥社保合肥醫院企業服務合肥法律

        代寫Implementation of Graph Algorithms

        時間:2023-11-14  來源:合肥網hfw.cc  作者:hfw.cc 我要糾錯


        C++ Implementation of Graph Algorithms

        1 Task Description

        You are asked to use C++ to solve the following puzzle.

        Hint: All it takes is an algorithm mentioned in this course (with a slight twist).

        The graph is undirected!

        2 Submission Guideline

        You must follow this guideline! Your submission will be marked automatically. Failure to

        follow this guideline will result in 0.

        Your submission should contain exactly one file: main.cpp.

        You do not need to submit a design.

        3 Puzzle

        You need to redesign the road system of an imaginary country.

        The country is composed of N cities (for simplicity numbered from 0 to N − 1). Some pairs of cities are

        connected by bidirectional roads. We say that there is a path between different cities A and B if there exists

        a sequence of unique cities C1, C2, . . . , CM, such that C1 = A and CM = B and for each index i < M, there

        is a road between cities Ci and Ci+1.

        The current state of the road network is miserable. Some pairs of cities are not connected by any path. On

        the other hand, other pairs of cities are connected by multiple different paths, and that leads to complicated

        traffic routing. You want to build some new roads and destroy some of the already existing roads in the

        country so that after the reconstruction there will exist exactly one path between every pair of distinct cities.

        As building new roads and destroying old ones costs a lot of money, you want to minimize the total cost

        spent on the reconstruction.

        You are given three two-dimensional arrays:

        • country[i][j]=1 or 0: there is an existing road between city i and j if and only if country[i][j]=1.

        • build[i][j]: the cost for building a road between i and j. The values of build[i][j] are represented

        using English letters. A, B, . . . , Z represent 0, 1, . . . , 25 and a, b, . . . , z represent 26, 27, . . . , 51. For

        example, if build[2][4]=b, then that means the cost for building a road between city 2 and city 4 is

        27.

        • destroy[i][j]: the cost for destroying a road between i and j. Again, the values are represented

        using English letters like the above.

        Your task is to find and print the minimal cost needed for the road network reconstruction.

        You don’t need to worry about invalid inputs.

        1

        • Sample input 1: 000,000,000 ABD,BAC,DCA ABD,BAC,DCA

        Note: 000,000,000 describes the two-dimensional array country. ABD,BAC,DCA describes the twodimensional array build. ABD,BAC,DCA describes the two-dimensional array destroy. The input

        format is: three strings separated by spaces; each string contains N parts separated by commas; each

        part contains N characters.

        Sample output 1: 3

        Comment: There are three cities, totally disconnected.

        • Sample input 2: 011,101,110 ABD,BAC,DCA ABD,BAC,DCA

        Sample output 2: 1

        Comment: Now the three cities form a connected triangle and we need to destroy one road. Optimal

        solution is to destroy the road between the cities 0-1 (cost 1).

        • Sample input 3: (note: all inputs are on the same line. I just couldn’t fit them in one line in this pdf.)

        011000,101000,110000,000011,000101,000110

        ABDFFF,BACFFF,DCAFFF,FFFABD,FFFBAC,FFFDCA

        ABDFFF,BACFFF,DCAFFF,FFFABD,FFFBAC,FFFDCA

        Sample output 3: 7

        Comment: We have six cities forming two separate triangles. Destroy one road in each triangle (costs

        1 for each road) and then join the triangles by a new road (costs 5).

        • Sample input 4: 0 A A

        Sample output 4: 0

        Comment: One city is okay just as it is.

        • Sample input 5: 0001,0001,0001,1110 AfOj,fAcC,OcAP,jCPA AWFH,WAxU,FxAV,HUVA

        Sample output 5: 0

        Comment: We have four cities, which are connected in such a way that there is exactly one path

        between each two cities.

        Thus there is nothing to reconstruct.

        4 Marking

        Marking will be done automatically. The total mark is 10 (1 for compiling and 9 for 9 test cases).

        5 Websubmission

        You are asked to submit via the web interface https://cs.adelaide.edu.au/services/websubmission/.

        The submission steps should be self-explanatory. Simply choose the correct semester, course, and assignment.

        The websubmission system will automatically fetch the latest version of your work from your SVN repository

        (you may also choose to submit older versions). Once your work is submitted, the system will launch a

        script checking the format of your submission. Click “View Feedback” to view the results. Your mark will

        be calculated offline after the deadline. You are welcome to resubmit for as many times as you wish (before

        the deadline).

        We will compile your code using g++ -o main.out -std=c++11 -O2 -Wall main.cpp. It is your responsibility to ensure that your code compiles on the university system.

        1

        1g++ has too many versions, so being able to compile on your laptop does not guarantee that it compiles on the university

        system. You are encouraged to debug your code on a lab computer (or use SSH).

        加QQ:99515681 或郵箱:99515681@qq.com   WX:codehelp

         

        掃一掃在手機打開當前頁
      1. 上一篇:代寫CMPT 125、c++設計編程代做
      2. 下一篇:代寫CS170編程、代做Java程序設計
      3. 無相關信息
        合肥生活資訊

        合肥圖文信息
        急尋熱仿真分析?代做熱仿真服務+熱設計優化
        急尋熱仿真分析?代做熱仿真服務+熱設計優化
        出評 開團工具
        出評 開團工具
        挖掘機濾芯提升發動機性能
        挖掘機濾芯提升發動機性能
        海信羅馬假日洗衣機亮相AWE  復古美學與現代科技完美結合
        海信羅馬假日洗衣機亮相AWE 復古美學與現代
        合肥機場巴士4號線
        合肥機場巴士4號線
        合肥機場巴士3號線
        合肥機場巴士3號線
        合肥機場巴士2號線
        合肥機場巴士2號線
        合肥機場巴士1號線
        合肥機場巴士1號線
      4. 短信驗證碼 酒店vi設計 NBA直播 幣安下載

        關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網 版權所有
        ICP備06013414號-3 公安備 42010502001045

        亚洲精品无码鲁网中文电影| 久久久久久亚洲精品无码| 精品日本一区二区三区在线观看 | 国产精品1区2区| 精品国产一区AV天美传媒| 伊人影视在线观看日韩区| 国产精品成人久久久久久久| 久久久精品久久久久三级| 亚洲午夜精品一区二区| 国产精品成人观看视频国产奇米| 国产一区麻豆剧传媒果冻精品 | 国产精品福利影院| 日韩精品无码一区二区中文字幕| 亚洲一区精品无码| 中文精品久久久久国产网站| 国产国产成人久久精品| 一本久久伊人热热精品中文| 四虎永久在线精品免费一区二区 | 国产成人麻豆精品午夜福利在线| 国产乱码精品一区二区三区香蕉| 国产午夜亚洲精品国产| 国产福利91精品一区二区三区 | 国产精品嫩草影院一二三区入口| 久久99精品久久久久久青青日本| 国产成人精品免费久久久久| 国产美女精品一区二区三区| 自拍偷在线精品自拍偷无码专区 | 婷婷99视频精品全部在线观看 | 丁香六月婷婷精品免费观看| 日韩字幕一中文在线综合| 日韩一区二区a片免费观看| 日韩人妻无码中文字幕视频| 日韩精品无码免费专区午夜不卡 | 日韩高清特级特黄毛片| 日韩中文字幕视频| 国产日韩视频在线观看| 秋霞日韩一区二区三区在线观看| 免费视频精品一区二区| 亚洲日韩精品无码专区网站| 国产精品一区在线观看你懂的| H无码精品3D动漫在线观看|