Breadth First Search algorithm in C

programming
1

Hi,

Im looking for a bit of guidance on this. I have a project for college for network design. It is to implement a C program for the breadth first search algorithm.

I can program in c but this is really confusing me, iv seen examples but they are hard to follow. Please see the brief below. Just need a push in the right direction to get started not the whole thing thanks.

BRIEF:

Implement Moores + Breadth First Search algorithm

-[FONT=&quot] [/FONT]Input a list of edges in the format

{A, B}

-[FONT=&quot] [/FONT]Where A, B are integers.
-[FONT=&quot] [/FONT]The application should return

[LIST]
[]Shortest path between a pair of user selected nodes.
[]A spanning tree for the network.
[/LIST]

Estimate the performance of the algorithm as a function of no of edges in the input list.

[FONT=&quot](I.e. time no of top level operations, memory usage etc)[/FONT]