Re: Help about Graphy Theory and Communication Networks plz..
- From: me@xxxxxxxxxxx (Jamie Andrews; real address @ bottom of message)
- Date: 16 Nov 2005 20:02:27 GMT
xeyder <xeyder@xxxxxxxxx> wrote:
> I have below problem . Does anyone know any existence algorithms or
> solutions to this problem ??
> 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.
> 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."
> 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?
Probably your Discrete Maths instructor or teaching
assistant could help you with this. They have probably been
teaching about graph theory in your class for several weeks.
Even if you haven't been going to class, they will probably help you.
--Jamie. (Celebrating (?) 20 years on Usenet!)
andrews .uwo } Merge these two lines to obtain my e-mail address.
@csd .ca } (Unsolicited "bulk" e-mail costs everyone.)
.
- 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: Help about Graphy Theory and Communication Networks plz..
- Next by thread: Re: Help about Graphy Theory and Communication Networks plz..
- Index(es):
Relevant Pages
|