Little help required

[find.dhiraj]

Hi,

I need little bit of help regarding the question below , any of your
additional insight beside mine to the problem will be a great help
for me

Consider the following, rather limited, design of a (directed) graph:
nodes in the graph are instances
of node objects, and arcs are pointers (of type node*) between the
objects. Each node object holds a container of some sort (e.g. an array
of type node**), which in turn stores the node's outgoing arcs. There
exists a special non-arc global pointer to the node created first, so
as to provide a handle to the graph itself.

Discuss the pros and cons of this design, e.g. reason about the time
complexity for finding the number of nodes in the graph, comment on
what must be done when new nodes are inserted, etc. Can you think of an
alternative representation that overcomes some of the shortcomings of
this approach?

Thanx in advance

[mlimber]

fi*********@gmail.com wrote:

I need little bit of help regarding the question below , any of your
additional insight beside mine to the problem will be a great help
for me

Consider the following, rather limited, design of a (directed) graph:
nodes in the graph are instances
of node objects, and arcs are pointers (of type node*) between the
objects. Each node object holds a container of some sort (e.g. an array
of type node**), which in turn stores the node's outgoing arcs. There
exists a special non-arc global pointer to the node created first, so
as to provide a handle to the graph itself.

Discuss the pros and cons of this design, e.g. reason about the time
complexity for finding the number of nodes in the graph, comment on
what must be done when new nodes are inserted, etc. Can you think of an
alternative representation that overcomes some of the shortcomings of
this approach?

See this link:

http://tinyurl.com/o5zw9

Cheers! --M

[Victor Bazarov]

fi*********@gmail.com wrote:

I need little bit of help regarding the question below , any of your
additional insight beside mine to the problem will be a great help
for me

Consider the following, rather limited, design of a (directed) graph:
nodes in the graph are instances
of node objects, and arcs are pointers (of type node*) between the
objects. Each node object holds a container of some sort (e.g. an
array of type node**), which in turn stores the node's outgoing arcs.
There exists a special non-arc global pointer to the node created
first, so as to provide a handle to the graph itself.

Discuss the pros and cons of this design, e.g. reason about the time
complexity for finding the number of nodes in the graph, comment on
what must be done when new nodes are inserted, etc. Can you think of
an alternative representation that overcomes some of the shortcomings
of this approach?

You're in luck! This is covered in the FAQ 5.2.

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

[red floyd]

fi*********@gmail.com wrote:

[blatant "do my homework for me" redacted]

What's your instructor's email address? I could send it directly to
him, and save you the trouble.

[utopia_euphoria]

hi,

Thnx for your kind words, and this is my first post regarding any
problem in this group,

Its not an assignment and i dont have an intructor , i'm trying to
solve a question in " Cprogramming how to" by Dietel and Dietel, and my
instructor would be me , I know the answers to this question but was
not sure if i am correct

As i figured out its a grpah in which every node might be connected to
every other node in short its a TSP Problem and its NP-Hard, and also
if the number of nodes increases the time complexity can be exponential
, if one needs to insert a node one cannot find node (i mean it depends
which search u use). the solution can get stuck in local maxima.

However i couldnt come up with an alternative solution for this
representations.

So any help would be appreciated.

and BTW I'm not
red floyd wrote:

fi*********@gmail.com wrote:

[blatant "do my homework for me" redacted]

What's your instructor's email address? I could send it directly to
him, and save you the trouble.

[utopia_euphoria]

hi,

Thnx for your kind words, and this is my first post regarding any
problem in this group,

Its not an assignment and i dont have an intructor , i'm trying to
solve a question in " Cprogramming how to" by Dietel and Dietel, and my
instructor would be me , I know the answers to this question but was
not sure if i am correct

As i figured out its a grpah in which every node might be connected to
every other node in short its a TSP Problem and its NP-Hard, and also
if the number of nodes increases the time complexity can be exponential
, if one needs to insert a node one cannot find node (i mean it depends
which search u use). the solution can get stuck in local maxima.

However i couldnt come up with an alternative solution for this
representations.

So any help would be appreciated.

and BTW I'm not
red floyd wrote:

fi*********@gmail.com wrote:

[blatant "do my homework for me" redacted]

What's your instructor's email address? I could send it directly to
him, and save you the trouble.

[red floyd]

utopia_euphoria wrote:

and BTW I'm not
red floyd wrote:

>fi*********@gmail.com wrote:

>>[blatant "do my homework for me" redacted]

What's your instructor's email address? I could send it directly to
him, and save you the trouble.

Its not an assignment and i dont have an intructor , i'm trying to
solve a question in " Cprogramming how to" by Dietel and Dietel, and my
instructor would be me , I know the answers to this question but was
not sure if i am correct

1. Please don't top post (
http://www.parashift.com/c++-faq-lite/how-to-post.html )-- reply moved
to conform to c.l.c++ netiquette.

2. If I just gave you the answer, you wouldn't learn a thing.

[Default User]

utopia_euphoria wrote:

hi,

Thnx for your kind words

Please don't top-post. See the newsgroup FAQ:
<http://www.parashift.com/c++-faq-lite/how-to-post.html>

Brian