Add ru version (#1865)

* Add Russian docs site baseline

* Add Russian localized codebase

* Polish Russian code wording

* Update ru code translation.

* Update code translation and chapter covers.

* Fix pythontutor extraction.

* Add README and landing page.

* placeholder of profiles

* Use figures of English version

* Remove chapter paperbook

ru/codes/go/chapter_graph/graph_dfs_test.go

@@ -0,0 +1,28 @@
+// File: graph_dfs_test.go
+// Created Time: 2023-02-18
+// Author: Reanon (793584285@qq.com)
+
+package chapter_graph
+
+import (
+	"fmt"
+	"testing"
+
+	. "github.com/krahets/hello-algo/pkg"
+)
+
+func TestGraphDFS(t *testing.T) {
+	/* Инициализация неориентированного графа */
+	vets := ValsToVets([]int{0, 1, 2, 3, 4, 5, 6})
+	edges := [][]Vertex{
+		{vets[0], vets[1]}, {vets[0], vets[3]}, {vets[1], vets[2]},
+		{vets[2], vets[5]}, {vets[4], vets[5]}, {vets[5], vets[6]}}
+	graph := newGraphAdjList(edges)
+	fmt.Println("Граф после инициализации:")
+	graph.print()
+
+	/* Обход в глубину */
+	res := graphDFS(graph, vets[0])
+	fmt.Println("Последовательность вершин при обходе в глубину (DFS):")
+	PrintSlice(VetsToVals(res))
+}