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.





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
Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.

creation,insertion,deletion of header linked list using c.

Merging 4 sorted files having 50, 10, 25 and 15 records will take time  O (100)

design algorithm and flow chart that computes the absolute difference of two values x and y

Q.   Draw the expression tree of the infix expression written below and then  convert it intoPrefix and Postfix expressions. ((a + b) + c * (d + e) + f )* (g + h )

how to draw a 5 inch square on the screen using * symbol

Data type An implementation of an abstract data type on a computer. Therefore, for instance, Boolean ADT is implemented as the Boolean type in Java, and bool type in C++;

what is far and near procedures in system programming?

Program for Linear Search. Program: Linear Search /*Program for Linear Search*/ /*Header Files*/ #include #include /*Global Variables*/ int search; int