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
The below figure illustrates the BOM (Bill of Materials) for product A. The MPS (Material requirements Planning) start row in the master production schedule for product A calls for

#questionalgorithm for implementing multiple\e queues in a single dimensional array

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

Polynomials like  5x 4    +  2x 3    +  7x 2     +  10x  -  8  can  be  represented by using arrays. Arithmetic operations such as addition & multiplication of polynomials are com

Describe different methods of developing algorithms with examples.

An advertising project manager developed the network diagram shown below for a new advertising campagign.  In addition, the manager gathered the time information for each activity,

Explain Backtracking The  principal idea is to construct solutions single component  at a time  and evaluate such  partially constructed candidates as follows. If a partiall

The complexity Ladder: T(n) = O(1). It is called constant growth. T(n) does not raise at all as a function of n, it is a constant. For illustration, array access has this c

Define about the Structure - Container - Some containers hold elements in some sort of structure, and some don't. Containers with no structure include bags and sets. Containe

D elete a specific Node from Double Linked List as follows DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FORW [ BACK [LOC]]:= FORW[LOC]& BACK [FORW[