[SDP/P] Initial solution to first exercise in project

1 files changed, 38 insertions, 0 deletions

diff --git a/Year 2/Structures and data algorithms/Project/exa/main.cpp b/Year 2/Structures and data algorithms/Project/exa/main.cpp
new file mode 100644
index 0000000..1698a2c
--- /dev/null
+++ b/Year 2/Structures and data algorithms/Project/exa/main.cpp
@@ -0,0 +1,38 @@
+#include "SkipList.hpp"
+#include <string>
+#include <iostream>
+
+int main() {
+	SkipList<std::string> cities;
+	cities.push("Sofia");
+	cities.push("Pazardzhik");
+	cities.push("Plovdiv");
+	cities.push("Dimitrovgrad");
+	cities.push("StaraZagora");
+	cities.push("NovaZagora");
+	cities.push("Yambol");
+	cities.push("Karnobat");
+	cities.push("Burgas");
+
+	cities.addSkip("Sofia", "Plovdiv");
+	cities.addSkip("Plovdiv", "NovaZagora");
+	cities.addSkip("Dimitrovgrad", "NovaZagora");
+	cities.addSkip("StaraZagora", "Yambol");
+	cities.addSkip("NovaZagora", "Burgas");
+
+	cities.print(std::cout) << std::endl;
+
+	SkipList<std::string> visit;
+	visit.push("Plovdiv");
+	visit.push("StaraZagora");
+	visit.push("Yambol");
+	visit.push("Burgas");
+	std::stack<std::string> path = cities.shortestSublistIncluding(visit);
+
+	while (!path.empty()) {
+		std::cout << path.top() << ", ";
+		path.pop();
+	}
+	std::cout << std::endl;
+	// path.print(std::cout) << std::endl;
+}