Assignment 1 - Directed GraphsOverviewYour task is to implement a directed graph class, offering a reasonably effective suiteof operations, including computing spanning trees, depth and breadth first traversals, and implementing iterators. The CodeYou are provided with a directed_graph.hpp file, which includes all the basicdefinitions you will need (and it can be done with just those - I made sure). You madeadd extra methods, classes, structs etc., as long as they dont interfere with theoperation of the tests. You may not include any further classes from the standardlibrary in any of your marked code. You have also been provided with a main.cpp forad-hoc testing purposes. main.cpp file does not form part of the assignment, and willnot be marked. You can do anything you like with it. When the run button is pressed,it will compile and run main.cpp. When the mark button is pressed, your code will berun against the tests. Note that as this is C++, if your code causes a program crash(e.g. a segfault), the testing code cannot recover, and will fail to mark your work - ifyou get this, make sure you fix that problem first!You have also been given a copy of test.h, which is the set of tests that the code willbe run against. Note that this code has had certain elements removed (things thatwould just give part of the solution), so its not runnable in its current state, but it mayhelp you understand where you program is failing, and to design your own tests to berun with main.cpp. Remember to read over all the code before starting. You have terminal access if you so desire it. Directed GraphsAs the abstract data structure, and the possibilities for implementing it, have beencovered in the lectures, I wont repeat them here. Please refer to the lecture materialfor the technical details in this regard. However, dont hesitate to ask questions etc. - youre welcome to inquire, I just dont want to clutter this space up!The directed_graph Classdirected_graph is probably the most complicated C++ class you will have had toimplement, but it bears a great resemblance to many of the things weve already done, so just break it down into smaller, more manageable tasks. The code itself iscommented to indicate the purpose of each method. Again, to avoid clutter, I wontrepeat it all here, but do not hesitate to ask if anything is unclear (theres a forumspecifically for the assignment). MarkingThe assignment will be marked against three components: functionality, design andstyle. Functionality will be marked exclusively by the tests, and constitutes 50% of the totalmark (note that the marks for the tests add up to 50 - so they give you the percentageyou will get as well). Design will be marked in your Week 9 tutorial by your tutor and constitutes 35% of thetotal mark. It does not depend on thDirected Graphs作业代做、C++课程设计作业代写、代做C++程序语言作业、directed_graph作业e functionality of your code. You may be askedquestions by your tutor to help them test your understanding of your code. It will bemarked qualitatively against the following rubric: Pass The code shows basic understanding of how to employ datastructures to achieve a goal. The design should avoid unnecessarydata structures and should make reasonable use ofiteration and recursion when appropriate. Credit The design shows a solid understanding of data structures anddemonstrate effective use of control structures to achieve theprogram’s goals. Distinction The design shows a high degree of understanding of how touse data structures to achieve a goal efficiently, and demonstratesome evidence that the design does not use unnecessaryresources. The design should be clean and efficient. ?High Distinction The design demonstrates a high degree of understanding ofdata structures and how to efficiently employ them to buildalgorithms that not only meet technical goals, but supportmaintenance and future development. Style will also be mark in your Week 9 tutorial by your tutor. It will be markedqualitatively against the following rubric: Pass The code mostly uses some formatting standard and is somewhatreadable. Credit The code adheres well to a formatting standard and variablesare well named. Distinction At least as well formatted as for Credit standards, along withsufficient inline commenting to explain the code. High Distinction Excellent formatting and variable naming. Excellent,judiciouslyemployed comments that explain the code without justrepeating the code. Marking ScheduleAll being well, assuming you submit before the deadline and attend your Week 9tutorial (in the class you are actually enrolled in - exceptions will only be made forcases where attendance at your enrolled tutorial is impossible), we aim to return themarks for the assignment within a week of the tutorial. However, we reserve the rightto delay this schedule should technical problems arise.SubmissionYou will submit your work with the mark button on Ed. No other submissions will beaccepted. You are welcome to develop your code elsewhere, if that suits yourworkflow, but remember it must compile and run on Ed. We are using the g++compiler set to C++17 standard for this assessment. However code that compiles withclang++ should also work with g++ (unless youre doing something weird - so checkfirst!). You may submit as many times as you like (in fact, repeated submission is anexpected part of the development process). Due DateThe assignment is due before midnight on the Friday of Week 8, which should be the10th of May (but check that date). Plagiarism CheckingAll code will be checked for student misconduct and plagiarism using specialised codesimilarity detection software.转自：http://www.7daixie.com/2019050812414996.html
网友评论