Hi all, this is my first post here. My problem is as follows:


Assignment 2 - Campus Safety System

Objectives:The purpose of this assignment is to test your ability to design efficient algorithms using Graphs, analyse them, and implement them in C++. Your program MUST work correctly on POMPEII using the g++ compiler. This assignment also tests your ability to understand standard specifications and follow instructions carefully. Failing to submit the assignment as required will cause you to fail the assignment.

Overview
To increase Campus Safety, the University is committed to install new specialised help and security units to provide a highly sophisticated safety network. These help and security units include dial-up to security office, alarm, Closed Circuit TV (CCTV) & Digital Video Recording (DVR) Systems,... Security and help units must be deployed in strategic locations around Macquarie University. However, due to related high costs of these units, their number must be limited. However, it is paramount that any one on Campus should find at least one in their building or an (immediately) neighbouring building (e.g., E6A and E5A).

You have been hired by the University Security services to write a program that will allocate the positions of all "help units" on the campus while minimising their number necessary to cover the whole campus adequately.

# The map of the campus are given to you as an undirected graph where:

    * the vertices represents the possible locations where you can install a help unit.
    * there is an edge between two locations (i.e., vertices) if they are immediate neighbours. If a vertex is not allocated with an help unit, there must be an help unit allocated to one of its neighbouring vertices.

# The locations (i.e., vertices) are numbered 1, 2, 3,...,n.

Your task is to find a solution that minimises the number of required units necessary to equip the whole campus.

PLZ help!!!!!! If anyone has an algorithm in mind please tell!