Define graph, Data Structure & Algorithms

A graph is a mathematical structure giving of a set of vertexes (v1, v2, v3) and a group of edges (e1, e2, e3). An edge is a set of vertexes. The two vertexes are named the edge endpoints. They are used to model real-world machines such as a city road network or the Internet airline connections. The wireframe drawings in computer graphics are another part of graphs.

A graph may be either directed or undirected. Intuitively, an undirected edge models a "duplex" or "two-way" connection between its endpoints, while a directed edge is a one-way connection, and is typically shown as an arrow. A directed edge is often named an arc. Mathematically, an undirected edge is an unordered pair of end points, and an arc is an ordered pair. You may need, why not use a single undirected edge for a two-way street. It's usually simpler and less error-prone to stick with all undirected or all directed edges.

An undirected graph may have at most edges, while a directed graph may have at most   edges. A graph is called sparse if it has many lesser than this many edges, and intense if it has closer to   edges.

 

 

 

598_Graph.png

Posted Date: 7/27/2012 6:25:32 AM | Location : United States







Related Discussions:- Define graph, Assignment Help, Ask Question on Define graph, Get Answer, Expert's Help, Define graph Discussions

Write discussion on Define graph
Your posts are moderated
Related Questions
Program: Creation of a linked list In the next example, wewill look to the process of addition of new nodes to the list with the function create_list(). #include #includ

Define about the class invariant A class invariant may not be true during execution of a public operation though it should be true between executions of public operations. For

Write a procedure (make-stack) that produces independent stack objects, using a message-passing style, e.g. (define stack1 (make-stack))  (define stack2 (make-stack)) W

In this unit, we discussed Binary Search Trees, AVL trees and B-trees. The outstanding feature of Binary Search Trees is that all of the elements of the left subtree of the root

We might sometimes seek a tradeoff among space & time complexity. For instance, we may have to select a data structure which requires a lot of storage to reduce the computation tim

Illustrate the Back Face Detection Method A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space me

Q. Write down the binary search algorithm and trace to search element 91 in following given list: 13          30          62           73         81         88             91

A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration o

what is frequency count with examble? examble?

State the example of pre- and post-conditions Suppose that function f(x) should have a non-zero argument and return a positive value. We can document these pre- and post-condit