Urgently need help in graph connectivity programming!

1

can anyone help me in graph connectivity programming??
i have no idea on how to do it!!!

Topic 4: Problem Description: Graph’s Connectivity

In mathematics and computer science a graph is a set of objects called points, nodes, or vertices connected by links called lines or edges. A link between two nodes indicates that the nodes are neighbours of each other. This program will determine whether a randomly generated graph is fully connected.
**[FONT=&quot]Input:[/FONT] [FONT=&quot]Maximum dimensions of an area (Xmax, Ymax), Number of nodes N, and distance D.[/FONT] **

[FONT=&quot]Program function: [/FONT]

[LIST]
[]Each node has a unique numeric identifier, which should be in the range from 0 to N-1.
[]Distribute the nodes in the given area randomly, such that each node has a position (x, y).
[]Each node is considered a neighbour to another node if the distance between them is less than D.
[]Determine if the graph is considered fully connected. A graph is considered fully connected if there exists a path between every pair of nodes in the graph.
[/LIST]
[FONT=&quot]Output:[/FONT]

[LIST]
[*]Print the coordinates for each of the nodes to a text file. The text file must be in the following format:
[/LIST]
<Node ID> <X> <Y>. For example,
0 3.22 4.22
1 1.45 2.34
2 2.42 4.23

[LIST]
[*]Print a statement to indicate whether the graph is fully connected.
[/LIST]

**Hints: **

[LIST]
[]Use array for graph implementation
[]Google keywords: breadth-first search and depth-first search.
[/LIST]