代写C++ DFS 数据结构作业、代写DFS C++实现
Please note that you have to typeset your assignment using either LATEX or Microsoft
Word, and produce a PDF file for submission. Hand-written assignment (or photo of
it) will not be graded. You need to submit an electronic version (in PDF form) on the
blackboard. You should name your file using the format CSE310-HW05-LastNameFirstName.
1. (20 points) Figure 1 shows a directed graph G. Assume that the adjacency list lists the
edges in alphabetical order.
B E
C F
A D G H
Figure 1: Graph for P1.
(a) Apply depth first search (DFS) to graph G, and show the discovery and finish times
of each vertex. In the main-loop of DFS, check the vertices in alphabetical
order. You can write the results on the graph in Figure 1.
(b) Draw the DFS tree obtained.
(c) Draw the transpose graph GT of the graph in Figure 1. The vertices are given for your
convenience.
B E
C F
A D G H
1
(d) Apply DFS to GT
to compute the strongly connected components. You need to show
the strongly connected components and indicate the order they are computed.
2. (10 points) This problem assumes an undirected graph obtained by ignoring the directions
of the graph in Figure 1. Assume that we perform breadth first search (BFS) on this graph,
starting at vertex A.
(a) Show the set of vertices L0, L1, L2, L3.
(b) Draw the resulting BFS tree.
3. (10 points) You are given two sequences X = AST U and Y = ASUT Z. Use dynamic
programming to compute the LCS of X and Y .
(a) Fill out the 20 entries in the following table. For each of the entries, you need to show
both the value and the arrow.
j 0 1 2 3 4 5
i A S U T Z
0 0 0 0 0 0 0
1 A 0
2 S 0
3 T 0
4 U 0
(b) What is the LCS computed according to the table?
4. (10 points) We want to use dynamic programming to compute the optimal ordering for computing
the chain of 6 matrices: A1A2A3A4A5A6, where Ai has pi?1 rows and pi columns.
Suppose that p0 = 10, p1 = 5, p2 = 20, p3 = 6, p4 = 30, p5 = 7, p6 = 100.
(a) Compute the entries m[i, j] and s[i, j] as shown in the lecture slides.
(b) Add parenthesise to show the optimal ordering.
http://www.6daixie.com/contents/13/1319.html
本团队核心人员组成主要包括硅谷工程师、BAT一线工程师，国内Top5硕士、博士生，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。
我们的方向领域：window编程 数值算法 AI人工智能 金融统计 计量分析 大数据 网络编程 WEB编程 通讯编程 游戏编程多媒体linux 外挂编程 程序API图像处理 嵌入式/单片机 数据库编程 控制台 进程与线程 网络安全 汇编语言 硬件编程 软件设计 工程标准规等。其中代写代做编程语言或工具包括但不限于以下范围:
C/C++/C#代写
Java代写
IT代写
Python代写
辅导编程作业
Matlab代写
Haskell代写
Processing代写
Linux环境搭建
Rust代写
Data Structure Assginment 数据结构代写
MIPS代写
Machine Learning 作业 代写
Oracle/SQL/PostgreSQL/Pig 数据库代写/代做/辅导
Web开发、网站开发、网站作业
ASP.NET网站开发
Finance Insurace Statistics统计、回归、迭代
Prolog代写
Computer Computational method代做
因为专业，所以值得信赖。如有需要，请加QQ：99515681 或邮箱：[email protected]
微信：codinghelp