Help about Graphy Theory and Communication Networks /C++ plz..

[xeyder]

Hi everyone..
I need help about graph theory ( network problems) ..

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.

In this experiment, you are supposed to develop a program that
generates graph structure
of a communication network given and implements some graph algorithms
which help
managing the network.
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/CODE/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?
Plz help..
Thanks in Advance..
Xeyder

 

[Kai-Uwe Bux]

Hi everyone..
I need help about graph theory ( network problems) ..

I have below problem . Does anyone know any existence algorithms or
solutions to this problem ?? [assignment snipped]
It is my assignment and I will code it in C++.

SO IS THERE ANY ALGORITHM/CODE/SOLUTION WAY for this problem..

I am sure there is. It just happens to be off topic here.

Your best bet with this assignment is to

a) ask for help with the algorithmic aspect in a general programing
newsgroup or a math forum, and

b) come back to this place when you run into coding problems that
are (1) related to standard C++ and (2) not related to compiler /
platform / library specific quirks.


Best

Kai-Uwe Bux

 

[Dave Townsend]

Hi everyone..
I need help about graph theory ( network problems) ..

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.

In this experiment, you are supposed to develop a program that
generates graph structure
of a communication network given and implements some graph algorithms
which help
managing the network.
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/CODE/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?
Plz help..
Thanks in Advance..
Xeyder

This is a classical algorithm, you should be able to find something on the
web if you
search for critical points or articulalation points.