initial

Author: igor

.gitkeep

@@ -0,0 +1,96 @@
+CC=g++ -std=c++17 -Wall -Werror -Wextra
+CHECKFLAGS=-lgtest
+CURRENTDIR = $(shell pwd)
+BUILD_DIR=build
+APP=Navigator
+REPORTDIR=gcov_report
+GCOV=--coverage
+OPEN=
+FILTER=
+CPPCHECKFLAG = --enable=all --suppress=unusedStructMember --suppress=missingIncludeSystem --language=c++ --std=c++17
+TEST_LIB:=./tests/tests_main.cc \
+    ./lib/s21_graph.cc \
+	./lib/s21_graph_algorithms.cc \
+	./lib/ant_algorithm.cc \
+	./lib/annealing_algorithm.cc \
+	./lib/genetic_algorithm.cc
+MVC:=main.cc \
+	./lib/s21_graph.cc \
+	./lib/s21_graph_algorithms.cc \
+	./lib/ant_algorithm.cc \
+	./lib/annealing_algorithm.cc \
+	./lib/genetic_algorithm.cc \
+	./view/console.cc \
+	./controller/controller.cc \
+	./model/navigator.cc
+
+OS = $(shell uname)
+
+ifeq ($(OS), Linux)
+	CC+=-D OS_LINUX -g -s
+	CHECKFLAGS+=-lpthread
+	CHECK_LEAKS=CK_FORK=no valgrind --leak-check=full --show-leak-kinds=all --track-origins=yes --log-file=log.txt
+	OPEN=xdg-open
+	DIR=
+	QTFLAGS=-spec linux-g++
+else
+	CC+=-D OS_MAC
+	CHECK_LEAKS=CK_FORK=no leaks --atExit --
+	FILTER=--gtest_filter=-*.Exception*
+	OPEN=open
+	DIR=/$(APP).app
+	QTFLAGS=
+endif
+
+all: build
+
+s21_graph.a:
+	@$(CC) -c ./lib/s21_graph.cc -o ./s21_graph.o
+	@ar rcs s21_graph.a ./s21_graph.o
+	@rm -rf s21_graph.o
+
+s21_graph_algorithms.a:
+	@$(CC) -c ./lib/s21_graph_algorithms.cc -o ./s21_graph_algorithms.o
+	@ar rcs s21_graph_algorithms.a ./s21_graph_algorithms.o
+	@rm -rf s21_graph_algorithms.o
+
+build: 
+	@$(CC) $(MVC) -o $(APP)
+	./$(APP)
+
+rebuild: clean build
+
+dvi:
+	doxygen ./docs/Doxyfile
+	$(OPEN) ./docs/html/index.html
+
+tests: mostlyclean
+	@$(CC) $(TEST_LIB) $(CHECKFLAGS) -o Test
+	@./Test
+	@rm -rf *.o *.a Test
+
+gcov_report: mostlyclean
+	@$(CC) $(TEST_LIB) -o Test $(GCOV) $(CHECKFLAGS)
+	@./Test
+	@lcov --no-external -c -d . -o $(APP).info
+	@genhtml -o $(REPORTDIR) $(APP).info
+	@$(OPEN) ./$(REPORTDIR)/index.html
+
+check: style cppcheck leaks
+
+style: 
+	@clang-format -style=google -verbose -n */*.cc */*.h
+
+cppcheck:
+	@cppcheck $(CPPCHECKFLAG) */*.cc */*/*.cc *.cc  */*.h */*/*.h *.h
+
+leaks: mostlyclean
+	@$(CC) $(TEST_LIB) $(CHECKFLAGS) -o Test
+	@$(CHECK_LEAKS) ./Test $(FILTER)
+	@rm -rf *.o *.a Test
+
+clean:
+	@rm -rf *.o *.a *.out *.gcno *.gch *.gcda *.info *.tgz $(REPORTDIR) Test $(BUILD_DIR) $(APP_DIR) $(APP) ./docs/html
+
+mostlyclean:
+	@rm -rf *.o *.out *.gcno *.gch *.gcda *.info *.tgz $(REPORTDIR) Test

Makefile

@@ -0,0 +1,32 @@
+# Simple Navigator v1.0
+The "Simple Navigator v1.0" is an app written in C++. The console application provides implementation several algorithms on graphs, such as traversal, finding shortest paths, finding the minimum spanning tree and solving travelling salesman problem.
+
+## Features
+- Console interface
+
+  ![Navigator Console Screenshot](./docs/images/Navigator_console.png)
+
+- Load graph as adjacency matrix from a specific file.
+- Non-recursive depth-first search in the graph.
+- Breadth-first search in the graph from a given vertex.
+- Searching for the shortest path between two vertices in a graph using Dijkstra's algorithm.
+- Searching for the shortest paths between all pairs of vertices in a graph using the Floyd-Warshall algorithm.
+
+  ![Floyd-Warshall Screenshot](./docs/images/Floyd_Warshall.png)
+
+- Searching for the minimal spanning tree in a graph using Prim's algorithm.
+
+  ![Prim Screenshot](./docs/images/Prim.png)
+
+- Solving the traveling salesman's problem using the ant colony algorithm.
+- Solving the traveling salesman's problem using the annealing simulation algorithm.
+- Solving the traveling salesman's problem using the genetic algorithm.
+
+  ![TSM Screenshot](./docs/images/TSM.png)
+
+- Performing a comparison of speed of the three algorithms for TSM problem.
+
+  ![Compare algorithms Screenshot](./docs/images/Compare_algorithms.png)
+
+## License
+Copyright (c). All rights reserved.

README.md

@@ -0,0 +1,29 @@
+#include "controller.h"
+
+Controller::Controller(Navigator* model) : model_(model) {}
+
+void Controller::FirstItem(std::string filename) {
+  model_->Navigator::FirstItem(filename);
+}
+
+GraphAlgorithms::Vector Controller::SecondItem(int start) {
+  return model_->SecondItem(start);
+}
+
+GraphAlgorithms::Vector Controller::ThirdItem(int start) {
+  return model_->ThirdItem(start);
+}
+
+int Controller::FourthItem(int vertex1, int vertex2) {
+  return model_->FourthItem(vertex1, vertex2);
+}
+
+GraphAlgorithms::Matrix Controller::FivthItem() { return model_->FivthItem(); }
+
+GraphAlgorithms::Matrix Controller::SixthItem() { return model_->SixthItem(); }
+
+TsmResult Controller::SeventhItem() { return model_->SeventhItem(); }
+
+std::vector<std::pair<double, double>> Controller::EighthItem(int cycles) {
+  return model_->EighthItem(cycles);
+}

controller/controller.cc

@@ -0,0 +1,23 @@
+#ifndef SRC_CONTROLLER_CONTROLLER_H
+#define SRC_CONTROLLER_CONTROLLER_H
+
+#include "../model/navigator.h"
+
+class Controller {
+ public:
+  explicit Controller(Navigator* model);
+
+  void FirstItem(std::string filename);
+  GraphAlgorithms::Vector SecondItem(int start);
+  GraphAlgorithms::Vector ThirdItem(int start);
+  int FourthItem(int vertex1, int vertex2);
+  GraphAlgorithms::Matrix FivthItem();
+  GraphAlgorithms::Matrix SixthItem();
+  TsmResult SeventhItem();
+  std::vector<std::pair<double, double>> EighthItem(int cycles);
+
+ private:
+  Navigator* model_;
+};
+
+#endif  // SRC_CONTROLLER_CONTROLLER_H