Advanced Algorithm (Solved)

computer science



                       Project  1


1.[40 points] Given the following directed weighted graph, make a python list for it. Make matrices for vertices V and edges E.


Your code must implement the following functions:


Input: input a node (say C)

Output:  (1) nodes connecting to this node

              (2) related edges (eg. Node C to F, and E to C, etc)

              (3) the weight and direction for each edge.


2.  Find the shortest and longest edge in your matrix. Analysis the running time (big O) for each case.











Related Questions in computer science category

The ready solutions purchased from Library are already used solutions. Please do not submit them directly as it may lead to plagiarism. Once paid, the solution file download link will be sent to your provided email. Please either use them for learning purpose or re-write them in your own language. In case if you haven't get the email, do let us know via chat support.