Select a community network system of your choice and model it using a graph data structure. Ensure that the network system chosen has at least nine (9) nodes (vertices) and the graph to be built is a strongly connected weighted directed graph (that is, there is at least one path between any two vertices to assure that every vertex is reachable from every other vertex). Store your graph data in a simple text file and ensure to confirm the implementation of your graph model by allowing the user to printout the graph after it has been built. Examples of community networks appropriate for modelling with a graph data structure within your community may include:

Fire hydrants

Playgrounds

Parks

Cable Cabinets

Stop signs / Stop Lights

Hydro / water meters

Bus stops

Etc.

Required:

a) Your graph network should have at least nine (9) vertices. Draw a labelled pictorial diagram of the network you are modeling. Vertices & edges should be labelled with the information that will be eventually implemented. (5 marks)

b) Ensure that your graph edges store appropriate weight information such as distance between nodes, time between nodes, cost to travel between nodes, bus# that travels between nodes etc. complete and submit the Adjacency List Structure corresponding to your pictorial diagram (5 marks)

c) Store your graph input data (corresponding to your pictorial model and your adjacency list structure) in a text file that will be used to test your implementation. graph input data file (5 marks)

d) Submit your C Program source file (.c)