Advanced Algorithm (Solved)
computer science
Description
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:
Test:
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.
