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
Define neotaxonomy. Discuss how electron microscopy can help in solving a zoological problem faced by taxonomist.

Q. Implement a stack making use of the linked list. Show the PUSH and POP operations both. A n s . Stack implemantation using linked list # include # include

complete information about collision resolution techniques

red black tree construction for 4,5,6,7,8,9


Question 1 Discuss the advantages of implementation checks preconditions Question 2 Write a ‘C' program to search for an item using binary search Question 3 Show that To

Comp are two functions n 2    and  2 n  / 4  for distinct values of n.   Determine When s ec on d function b ec om es l a r g er th an f i r st functi

A shop sells books, magazines and maps. Every item is identified by a unique 4 - digit code. All books have a code which starts with 1, all maps have a code starting with 2 and all

how we can convert a graph into tree

In this respect depth-first search (DFS) is the exact reverse process: whenever it sends a new node, it immediately continues to extend from it. It sends back to previously explore