合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

        代寫ecs36c 有向圖程序

        時間:2023-11-29  來源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯


        ecs36c
        ecs36c/hw4

        Homework Spec
        In this homework, you will write one data structure Directed Graph, and then build two
        algorithms Breath First Search (BFS) and Depth First Search (DFS) on the graph.
        You will implement Graph first and then implement BFS and DFS and their related
        functions.
        In reality, a adjacent list does not require order, so a better way to implement them
        is to use unordered_map and unordered_set (or just dynamic array). In this
        homework assignment, we keep the order for easier testing.
        The reason to keep a Map<NodeValue, Node> is to utilize the textbook pseudocode
        and definition that modifies the fields of the node. In reality we can just use some
        array or unordered_set to keep track of which vertices are visited instead of
        changing its color.
        Grading
        You will be graded only on the same (hidden) test cases your TAs created.
        We provided some tests cases in ./tests. Feel free to modify and add more test cases,
        but the ./tests in your submission will not be graded. However, you will be able to see the
        results for your submitted test cases on Gradescope.
        DirectedGraph implementation - 30%
        BFS function - 35%
        DFS function - 35%
        NOTE: If you are running out of time to implement all methods (or just want to see
        the project can be compiled), please at least provide a syntactically valid empty
        method definition for each method in lib/*.cpp .
         2 - ecs36c/hw4: Graph, BFS, Shortest Path, DFS, and Topological Sort
         3/5
        DirectedGraph
        Check the definition for GraphNode in lib/GraphNode.hpp.
        Check the definition for Graph in lib/Graph.hpp.
        Create test cases in tests/TestGraph.cpp.
        NOTE When updating the edges or vertices, both _adjList and _vertices should be
        updated.
        Breath First Search
        Implement std::vector<T> BFS(T start); defined in lib/Graph.hpp.
        For the queue used in BFS , please use C++ standard library by #include 
        <queue> .
        Implement int shortestPath(T start, T end) defined in lib/Graph.hpp.
        You can assume BFS is never called before calling shortestPath .
        Create test cases in tests/TestBFS.cpp.
        For formal definitions, please refer to textbook 20.2.
        We provide the example graph (Figure 20.3) in test/TestBFS.cpp for you to test your
        code.
        Depth First Search
        Implement std::vector<T> DFS(); defined in lib/Graph.hpp.
        Create test cases in tests/TestDFS.cpp.
        For formal definitions, please refer to textbook 20.3.
        We provide the example graph (Figure 20.4) in test/TestDFS.cpp for you to test your
        code.
        You can implement void DFS_visit(const T &u, int &time, std::list<T> 
        &record); to help add the Node.value to a record vector.
        Submission
        Use ./generate_submission.sh and submit hw4-submission.zip on Gradescope.
        Setup
        Use one of the following options to set up your environment.
        README.md2023/11/25 2 - ecs36c/hw4: Graph, BFS, Shortest Path, DFS, and Topological Sort
         4/5
         If you're a student, DO NOT FORK this repository because you cannot change
        the visibility of a forked repo to private. If you plan to use Git for version control
        (which is encouraged), run rm -rf .git && git init (or change remote) after
        setting up using one of the options below and push to your private repository. Any
        public repository containing part of this homework solution will be reported to SJA.
        Option 1: VS Code with Local Dev Container
        If Docker is not running, start Docker.
        Click the following button to set up the environment. LLooccaall DDeevv CCoonnttaaiinneerr Setup
        When asked for selecting a Kit to configure CMake, choose GCC.
        Option 2: VS Code with Remote Dev
        Connect VS Code to the remote host.
        Install C/C++ Extension Pack on Remote Server (if not already).
        Run the following command inside the integrated terminal.
        git clone 
        Run code ./ecs36c-hw4 to open the folder.
        When prompted to configure CMake, confirm and choose GCC when prompted for
        kit selection

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

        掃一掃在手機打開當(dāng)前頁
      1. 上一篇:CSCC43代做、R設(shè)計編程代寫
      2. 下一篇:代做EF5070、代寫c/c++編程設(shè)計
      3. 無相關(guān)信息
        合肥生活資訊

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

        關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網(wǎng) 版權(quán)所有
        ICP備06013414號-3 公安備 42010502001045

        精品久久久久久久免费人妻| 婷婷五月深深久久精品| 2020无码专区人妻系列日韩| 67194国产精品免费观看| 国产精品永久久久久久久久久| 国产亚洲精品免费| 国产精品成人久久久久久久| 国产精品成人va在线观看| 一本一道久久精品综合| 国产精品99精品无码视亚| 日韩免费一级毛片| 国产美女精品三级在线观看 | 亚洲高清国产拍精品青青草原| 精品香蕉久久久午夜福利| 亚洲国产精品成人综合色在线婷婷| 久9这里精品免费视频| 国产女人精品视频国产灰线| 精品在线一区二区| 精品一区二区三区中文| 日韩精品一线二线三线优势| 日韩av无码久久精品免费| 国产日韩一区二区三免费高清| 日韩少妇无码喷潮系列一二三| 国产成人亚综合91精品首页| 国产精品国语对白露脸在线播放 | 亚洲性色精品一区二区在线| 91精品福利一区二区| 99精品国产高清一区二区麻豆| 国产精品久久久久9999高清| 国产精品久久久久影院色| 97精品久久天干天天天按摩| 在线精品一卡乱码免费| 模特私拍国产精品久久| 亚洲精品无码久久久久牙蜜区| 亚洲精品动漫免费二区| 国产精品久久久久乳精品爆| 精品免费国产一区二区| 国产成人精品午夜视频'| 亚洲av日韩av高潮潮喷无码| 日韩黄a级成人毛片| 亚洲精品无码激情AV|