diff options
| author | Gustav Sörnäs <gustav@sornas.net> | 2020-12-03 17:11:43 +0100 |
|---|---|---|
| committer | Gustav Sörnäs <gustav@sornas.net> | 2020-12-08 10:21:07 +0100 |
| commit | 0c39051ba80f04b1177833a006f2d442a7170b56 (patch) | |
| tree | 9e657946a061b5b305f9cf75634db7b37e979eb3 /labb8/src/trailblazer.cpp | |
| parent | 7b7f6808a7b2db2ed21103767434c1445f7815c2 (diff) | |
| download | tddd86-0c39051ba80f04b1177833a006f2d442a7170b56.tar.gz | |
add initial files l8
Diffstat (limited to 'labb8/src/trailblazer.cpp')
| -rwxr-xr-x | labb8/src/trailblazer.cpp | 45 |
1 files changed, 45 insertions, 0 deletions
diff --git a/labb8/src/trailblazer.cpp b/labb8/src/trailblazer.cpp new file mode 100755 index 0000000..38e168b --- /dev/null +++ b/labb8/src/trailblazer.cpp @@ -0,0 +1,45 @@ +// This is the CPP file you will edit and turn in. +// Also remove these comments here and add your own, along with +// comments on every function and on complex code sections. +// TODO: write comment header for this file; remove this comment + +#include "costs.h" +#include "trailblazer.h" +// TODO: include any other headers you need; remove this comment +using namespace std; + +vector<Node *> depthFirstSearch(BasicGraph& graph, Vertex* start, Vertex* end) { + // TODO: implement this function; remove these comments + // (The function body code provided below is just a stub that returns + // an empty vector so that the overall project will compile. + // You should remove that code and replace it with your implementation.) + vector<Vertex*> path; + return path; +} + +vector<Node *> breadthFirstSearch(BasicGraph& graph, Vertex* start, Vertex* end) { + // TODO: implement this function; remove these comments + // (The function body code provided below is just a stub that returns + // an empty vector so that the overall project will compile. + // You should remove that code and replace it with your implementation.) + vector<Vertex*> path; + return path; +} + +vector<Node *> dijkstrasAlgorithm(BasicGraph& graph, Vertex* start, Vertex* end) { + // TODO: implement this function; remove these comments + // (The function body code provided below is just a stub that returns + // an empty vector so that the overall project will compile. + // You should remove that code and replace it with your implementation.) + vector<Vertex*> path; + return path; +} + +vector<Node *> aStar(BasicGraph& graph, Vertex* start, Vertex* end) { + // TODO: implement this function; remove these comments + // (The function body code provided below is just a stub that returns + // an empty vector so that the overall project will compile. + // You should remove that code and replace it with your implementation.) + vector<Vertex*> path; + return path; +} |
