Reference no: EM131177331
Graph Algorithms
For this assignment, you will be coding 5 different graph algorithms. WARNING: This homework has quite a few files in it, so you should make sure to read ALL of the documentation given to you, including this pdf as well as all of the javadocs before asking a question.
Graph Representations
For this assignment, you will be using two different representations of graphs, the adjacency list and adjacency matrix. The adjacency list will be used for BFS, Dijkstra's, Prim's and Kruskal's. The adjacency matrix will be used for DFS. Generally, an adjacency matrix is better for when the graph is dense (many edges), and an adjacency list is better for when the graph is sparse (fewer edges). Also, it's worth noting from here on out, the time complexities will have two inputs, jV j to mean the number of vertices, and jEj to mean the number of edges. Although it is true that a simple graph can have at most jEj ≤ jV j(jV 2 j-1) = O(jV j2) edges, other than this, there isn't really any relationship between jV j and jEj. Keep in mind that the way that the graph is stored/represented will affect the time complexity of the algorithm. For example, for Dijkstra's algorithm, if an adjacency matrix is used, the time complexity is O(jV j2) while if an adjacency list with a priority queue is used, it is instead O(jEj + jV j log jV j).
Search Algorithms
The first two algorithms are breadth-first search (BFS) and depth-first search (DFS). These algorithms are search algorithms that start at the given vertex and traverse the entire graph in a particular order (the order in which the vertices are visited depend on whether you are doing breadth-first search or depth-first search, the edges that are in the graph, and the order the adjacent vertices are listed)
|
Find the length of a shortest path between them
: Given the list of edges and weights of these edges of a weighted connected simple graph and two vertices in this graph, find the length of a shortest path between them using Dijkstra's algorithm. Also, find a shortest path.
|
|
Describing the organization and its nature of functions
: Based on your readings and through additional research write a 4- to 6-page proposal to the CEO. Use this as an outline for your proposal: Begin your proposal by briefly describing the organization and its nature of functions. Again, if it is one..
|
|
Identify the measures of location and dispersion
: Identify the probability of the sample mean of number of pledges (monthly) received post-Year 2000 is more than 260,000 per month
|
|
Create dependency diagrams for all entities in your database
: Create dependency diagrams for all entities (tables) in your database. Be sure that each entity (table) is in 3NF and includes a relational. These cannot be hand-written/drawn; use Word, PowerPoint, or MS Visio via the XenDesktop to accomplish thi..
|
|
Different graph algorithms
: For this assignment, you will be coding 5 different graph algorithms. WARNING: This homework has quite a few files in it, so you should make sure to read ALL of the documentation given to you, including this pdf as well as all of the javadocs befo..
|
|
Construct an euler path or circuit if it exists
: Given the vertex pairs associated to the edges of a multigraph, determine whether it has an Euler circuit and, if not, whether it has an Euler path. Construct an Euler path or circuit if it exists.
|
|
Find the number of paths of length n between two vertices
: Given an adjacency matrix of a graph and a positive integer n, find the number of paths of length n between two vertices. (Produce a version that works for directed and undirected graphs.)
|
|
Identify at least one potential gap in empirical research
: List 1- to 2-potential theoretical foundations and/or conceptual frameworks that may guide your study. State the key concepts of the theory and how they are related. For conceptual framework, describe the particular "lens" this framework offers fo..
|
|
Generate a simple graph with n vertices
: Given a positive integer n, generate a simple graph with n vertices by producing an adjacency matrix for the graph so that all simple graphs with n vertices are equally likely to be generated.
|