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
A full binary tree with n leaves have:- 2n -1 nodes.

The process of accessing data stored in a serial access memory is same to manipulating data on a By using stack  method.

Binary Space Partition A binary space-partitioning (BSP) tree is an efficient method for determining object visibility by painting surfaces onto the screen from back to front,

Write an algorithm, using a flowchart, which inputs the heights of all 500 students and outputs the height of the tallest person and the shortest p erson in the school.

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is called as a   Queue.


Thread By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using either a stack

write an algorithm and draw a flowchart to calculate the perimeter and area of a circle

Q. Write down an algorithm to add an element in the end of the circular linked list.        A n s . Algo rithm to Add the Element at the End of Circular Linked Lists

What do we mean by algorithm? What are the characteristics of a good and relevant algorithm? An algorithm is "a step-by-step procedure for finishing some task'' An algorithm c