Is there a graphing library I can use?

[hsn]

hello every one
we all have taken graphs in our algorithm sumbject in the begining of our computer life.

i was reading a question on the inernet and it was really intresting. so i started working on it.
after a while i found that if i used a graph it will be very easy
the problem i didn't ever used graphes 9in programming and i was woundering if there is a class that is ready to do it.

for my code i need to give two nodes (which are connected) over and over
so after the input is finished i want to see how many nodes are connected to each other .

thank you for reading my question and plz reply

hsn

[RRick]

There are plenty of graphics libraries, but be ready to change you idea of programming. The minute you say "graphs" or drawings you need to select a gui to do this within. In windows, there is a class of programs for this and it has no relation to the "Hello World" program we started with. Unix has a similar gui based on X-Windows.

Once you pick a gui, you can start looking at packages/toolkits that support what you're looking for. Unless you are bound to C/C++ I would suggest looking at other programming environments. Tcl/Tk is one, but I haven't used it personally.

In the world of C/C++, Qt is a toolkit that might have what you need.

[Laharl]

If you just want code that allows you to work with graphs, without a GUI, the Boost library has several graph headers/algorithms/classes/etc.

[hsn]

guys u don't understand what i am asking for

what i want is to create a program to add two nodes(which are connected) in a for loop. and after the end of the for loop i want to see an output that will show the nodes' names that create the largest connected graph
that is it.
i don't need a gui or anything that is too complex
no adding new toolkits and nothing like that
because i am enroled to a programming contest and no such extra tools are available.
thank you


hsn

[Laharl]

Then you should write your own graph classes. There are two common methods, adjacency lists and adjacency matrices. Wikipedia has good articles about both.