Data Structures Final Paper

STRATFORD UNIVERSITY SOF 510 Algorithms and Data Structures Final Exam 1.Given an undirected interpret, described with the frozen of vertices and the set of edges, (20 Points) Ans: A represent is a ingathering (nonempty set) of vertices and edges Vertices: target have names and properties Edges: connect two vertices, rump be labeled, can be directed Adjacent vertices: if in that respect is an edge among them. Example: Vertices: A,B,C,D Edges: AB, AC, BC, CD Draw the picture of the represent Give an example of a channel, a impartial path, a motorbike A path is a list of vertices in which successive vertices are connected by edges Examples: Some paths in Graph : A B C D A C B A C D A B D C B C B A Simple path: No crown is repeated. Examples: In Graph, D C B A is a simple-minded path, while D C B A C is not a simple path Cycles : A cycle is a simple path with trenchant edges, where the first vertex is equal to the last.

Examples: Cycles in Graph: C A B C, C B A C, A B C A, A C B A, B A C B, B C A B A B A is not a cycle, because the edge A B is the same as B A Determine whether the represent is connected or disconnected Connected graph: in that location is a path between each two vertices The preceding(prenominal) graph is connected graph Give the matrix design of the graph Vertices: A,B,C,D ! Edges: AB, AC, BD, CD | |A |B |C |D | |A |0 |1 |1 |0 | |B |1 |0 |0 |1 | |C |1 |0 |0 |1 | |D |0 |1 |1 |0 | Give the contiguousness lists representation of the graph Adjacency list...If you want to get a near essay, assemble it on our website: OrderEssay.net

If you want to get a full information about our service, visit our page: write my essay