analysis of graph
$10-30 USD
货到付款
[login to view URL]
Project#3: Analysis of a large Graph.
In this program you are to select a partner or develop the program by yourself. If you have a partner send me an email stating who is on the team. Each team (whether 1 or 2 individuals) will select one of the large data sets to process. No two teams can have the same data set. When you form a partnership and send me the above email also indicate which data set you will process. If you are first to request that dataset you will get it.
Your project will involve the downloading of the data set following by the reading and processing of this data set. Processing will involve the following collection of tasks
1. Read in the data from the file and load the information into an adjacency list that is defined in a class
2. Print out the files name you downloaded and processing
3. Print out the names of the programmers.
4. Print out the number of vertices and number of edges.
5. Write a method that will determine if the graph has cycles and how many.
6. Write a method that will generate the transpose of G, i.e. GT
7. Write a method that will determine the number of strongly connected components and the number of nodes and edges in each.
8. Create a main program that will call and display the results of the above program methods.
Turn In:
Write a report of several pages discussing the algorithms and results of your processing. Include a discussion of the data set and its meaning as well as the meaning of its nodes and vertices as well as output within this context. Also turn in the source and output of the above program.
Documentation: Document as I indicated at the start of the class. Each method, module or function must have documentation and the name of the programmer (only one name per method)
项目ID： #7506424
关于项目
授予：
----------------------------------------------------------------------------------------------------
有7名威客正在参与此工作的竞标，均价$67/小时
i'm good at implementing algorithm and data structures in c and c++and i prefer completing my work first.
