summaryrefslogtreecommitdiffstats
path: root/labb8/src/trailblazer.h
diff options
context:
space:
mode:
authorGustav Sörnäs <gustav@sornas.net>2020-12-03 17:11:43 +0100
committerGustav Sörnäs <gustav@sornas.net>2020-12-08 10:21:07 +0100
commit0c39051ba80f04b1177833a006f2d442a7170b56 (patch)
tree9e657946a061b5b305f9cf75634db7b37e979eb3 /labb8/src/trailblazer.h
parent7b7f6808a7b2db2ed21103767434c1445f7815c2 (diff)
downloadtddd86-0c39051ba80f04b1177833a006f2d442a7170b56.tar.gz
add initial files l8
Diffstat (limited to 'labb8/src/trailblazer.h')
-rwxr-xr-xlabb8/src/trailblazer.h23
1 files changed, 23 insertions, 0 deletions
diff --git a/labb8/src/trailblazer.h b/labb8/src/trailblazer.h
new file mode 100755
index 0000000..154085e
--- /dev/null
+++ b/labb8/src/trailblazer.h
@@ -0,0 +1,23 @@
+/*
+ * TDDD86 Trailblazer
+ * This file declares the functions you will write in this assignment.
+ *
+ * Please do not modify this provided file. Your turned-in files should work
+ * with an unmodified version of all provided code files.
+ *
+ * Author: Marty Stepp
+ * Slight modifications by Tommy Farnqvist
+ */
+
+#ifndef _trailblazer_h
+#define _trailblazer_h
+
+#include <vector>
+#include "BasicGraph.h"
+
+vector<Node*> depthFirstSearch(BasicGraph& graph, Node* start, Node* end);
+vector<Node*> breadthFirstSearch(BasicGraph& graph, Node* start, Node* end);
+vector<Node*> dijkstrasAlgorithm(BasicGraph& graph, Node* start, Node* end);
+vector<Node*> aStar(BasicGraph& graph, Node* start, Node* end);
+
+#endif