From 06e1b9276cc1c709a24665399abebcdcefd3cb3e Mon Sep 17 00:00:00 2001 From: Syndamia Date: Tue, 27 Dec 2022 10:40:43 +0200 Subject: [SDP/P] Initial solution to first exercise in project --- .../Project/exa/main.cpp | 38 ++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 Year 2/Structures and data algorithms/Project/exa/main.cpp (limited to 'Year 2/Structures and data algorithms/Project/exa/main.cpp') 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 +#include + +int main() { + SkipList 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 visit; + visit.push("Plovdiv"); + visit.push("StaraZagora"); + visit.push("Yambol"); + visit.push("Burgas"); + std::stack path = cities.shortestSublistIncluding(visit); + + while (!path.empty()) { + std::cout << path.top() << ", "; + path.pop(); + } + std::cout << std::endl; + // path.print(std::cout) << std::endl; +} -- cgit v1.3.1-23-gd82d