Re: Help about Graphy Theory and Communication Networks plz..
- From: nathan.gilbert@xxxxxxxxx (Nathan Gilbert)
- Date: 16 Nov 2005 22:53:33 GMT
xeyder <xeyder@xxxxxxxxx> wrote:
> The Problems is:
> " We can use graphs to represent a communication network. In such
> graphs, the vertices
> represent communication stations and the edges represent communication
> links. Critical points are the vertices whose failure will result in
> the network
> becoming disconnected. Similarly, critical links are the edges whose
> failure will result a
> loss of communication. Sub components are the graphs which don't
> contain no critical
> points.
So, sub-components are graphs which contain critical points?
>
> For the given a communication network as an undirected graph G(V,E),
> write a program
> that will do the following :
> a) Find all critical points in G.
> b) Find all critical edges in G.
> c) Find the sub components in G."
>
> It is my assignment and I will code it in C++.
>
> SO IS THERE ANY ALGORITHM/SOLUTION WAY for this problem..
> I am new to graph theory and this kind of maths..it is discrete maths
> problem I think ,
> Anyone has any idea?
I'm making the assumption that this is an undergraduate class, which if it is,
I'm 99.9% sure this is an answer to this, in fact there may be many.
Draw several examples out by hand and solve them yourself. A pattern should arise.
Translate this pattern to C++.
NG
--
"The life of a repoman is always intense."
.
- Follow-Ups:
- Re: Help about Graphy Theory and Communication Networks plz..
- From: Nicholas King
- Re: Help about Graphy Theory and Communication Networks plz..
- References:
- Prev by Date: Re: Can someone give me an example of this type of problem?
- Next by Date: Re: Can someone give me an example of this type of problem?
- Previous by thread: Re: Help about Graphy Theory and Communication Networks plz..
- Next by thread: Re: Help about Graphy Theory and Communication Networks plz..
- Index(es):
Relevant Pages
|