Closed

SA project

This project is divided into parts. Part 1 contains some methods and simple data structures that you

have to develop. And of course an application function. What you should do keep track of the

modules that you build and understand what you are doing as you might have to produce variant

versions of any codeline. You will build more into the project as you go.

Part 1

Building and testing “link” data structure. This part is composed of 3 codelines ([url removed, login to view], [url removed, login to view],

[url removed, login to view]) and a baseline (composed of the 3 codelines).

file: [url removed, login to view]: contains the application function and a unit test for the baseline.

file: link.h: contains the definition of the class link

class name: link

private class members: char c1, char c2, float linkCost

public class methods:

default constructor,a constructor that sets all three private class members,a destructor,a =operator,and methods to query the private class members.

file: [url removed, login to view]: contains the implementation of the class link .

file: acquireLinks.h: contains the function signature: void acquireLinks(vector<link> &links) .

file: [url removed, login to view] : in this file you will implement the function acquireLinks to read links data

from a file. A perfect example of an input file for a uniform cost search algorithms would be a file

that contains the following (using the example presented in class):

Part 2

file: node.h : contains the definition of the class node

class name: node

private class members: char name; node* pParent; node* pNext; float cost; bool explored;

public class methods: default constructor,

a constructor that sets all 5 private class members,a destructor,a =operator, a function isGoal with signature: bool isGoal(char goalCity),methods to query the private class members (i.e. to guarantee data

hiding)

file: [url removed, login to view] : contains the implementation of the class node. The function isGoal: returns true if

the calling node name is the same as the goalCity, and returns false otherwise.

Part 3

file: list.h: contains the definition of the class list

class name: list

private class members: ndoe* pFirstNode, node* pLastNode

public class members: default constructor,a constructor that sets all private class members,a destructor,a =operator,a function printList with signature: void printList(void),methods to query the private class members (i.e. to guarantee data

hiding)

file: [url removed, login to view] : contains the implementation of the class list. The function printList prints out on

console the names of the nodes in the calling list (it should be easily modified to bring any

information about the nodes in the calling list.

Build the following function: void list::printResult(void)

//this function is to print (to console) the solution path along with its cost. It should also

display number of nodes expanded (i.e. how many times the method

node::expand(vector<link>, list*) was called

Build the following function: void list::printList(void)

//update this function such that it prints to console (for a given node):

name parent's name cost

e.g. b a 4

file: node.h: add 2 functions with signature:

void expand(vector<link> &links, list* pFrontier);

void pushNodeToList(list* pFrontier);

file: [url removed, login to view]: conatins the implementation of the function: expand: that finds potential sibling

nodes of the calling node and pushes potential nodes to list pFrontier (by calling

pushNodetoList(pFrontier)).

Build the following function: bool node::isQualified(list* pFrontier)

// this function determines if the calling node (which is a potential node) is qualified to be

added to the input argument list. The function should also discard from the list any node

once a cheaper replacement for it is found.

file: [url removed, login to view]: should now construct the first node, initialize the Frontier list using the first node,

expand potential siblings to the list, and terminates only if a goal is picked.

Part 4

Update all the required methods/classes such that the algorithm is capable of solving the search

problem using any of the 5 studied algorithms.

Skills: C++ Programming, Java

See more: roulette number display project, update project server excel psi task update, auto update shipping method cart magento, glenside campus redevelopment project, sa sa art projects, sasa art gallery phnom penh, glenside hospital redevelopment, renewal sa land for sale, sa sa bassac phnom penh, glenside living prices, urban renewal project henley beach, java, c++ programming, data structures, pcb number display project, telephone number display project, project description inventory control system update, aspnet updatepanel parent control update, update code project excel vba, aspnet ajax update parent panel

About the Employer:
( 0 reviews ) Egypt

Project ID: #16590312

6 freelancers are bidding on average $29 for this job

$25 USD in 1 day
(54 Reviews)
5.2
uzafar99

Hi, I can help you. I am a CS undergrad studying at the top ranked university of my country. I have over 7 years of programming experience and I will not waste your time. Please PM for details. Regards, Usama

$35 USD in 1 day
(12 Reviews)
4.1
WebGreenSoft

Dear Employer, I am ready to work on your required task and can also give 100% satisfaction. Please respond so we can discuss further details. Thanks

$25 USD in 1 day
(10 Reviews)
3.4
todo2095

hi there, i'm a professional programmer and i will be happy to help you, i'm available to start now, contact me to discuss more

$35 USD in 1 day
(14 Reviews)
3.5
$25 USD in 1 day
(0 Reviews)
0.0
mtr57b124089ea0c

Computer engineering student with great experience in C++, Java, ActionScript, Python, XML and HTML. I'll finish you're program as fast as I can and will update you on the progress regularly.

$30 USD in 2 days
(0 Reviews)
0.0