deeppavlov · dariaolshevskaya · Apr 28, 2025 · Apr 28, 2025 · May 5, 2025 · May 5, 2025
diff --git a/experiments/exp2025_04_07_testing_graph_coverage/README.md b/experiments/exp2025_04_07_testing_graph_coverage/README.md
@@ -0,0 +1,13 @@
+# Getting started with dialogue augmentation with full graph coverage
+
+## Goal
+
+Goal is to develop an algorithm for determining the minimum number of augmented dialogues required to fully cover the corresponding graph.
+
+## Results
+
+A basic algorithm for covering a graph with dialogues has been developed. The starting dialogue is the dialogue with the maximum number of lines. Each new dialogue to add is determined by the maximum number of new elements (which are new nodes and edges).
+
+## Future plans
+
+In the future, it is planned to add this algorithm into dev branch as a new class. Also, it may be reasonable to get starting dialogue by maximum number of unique nodes and edges, and not lines.
diff --git a/...nts/exp2025_04_07_testing_graph_coverage/exp2025_04_07_testing_graph_coverage/__init__.py b/...nts/exp2025_04_07_testing_graph_coverage/exp2025_04_07_testing_graph_coverage/__init__.py
diff --git a/..._testing_graph_coverage/exp2025_04_07_testing_graph_coverage/testing_graph_coverage.ipynb b/..._testing_graph_coverage/exp2025_04_07_testing_graph_coverage/testing_graph_coverage.ipynb
diff --git a/experiments/exp2025_04_07_testing_graph_coverage/poetry.lock b/experiments/exp2025_04_07_testing_graph_coverage/poetry.lock
diff --git a/experiments/exp2025_04_07_testing_graph_coverage/pyproject.toml b/experiments/exp2025_04_07_testing_graph_coverage/pyproject.toml
@@ -0,0 +1,16 @@
+[project]
+name = "exp2025-04-07-testing-graph-coverage"
+version = "0.1.0"
+description = ""
+authors = [
+    {name = "dariaolshevskaya",email = "olshevskaya.d@bk.ru"}
+]
+readme = "README.md"
+requires-python = ">=3.11"
+dependencies = [
+]
+
+
+[build-system]
+requires = ["poetry-core>=2.0.0,<3.0.0"]
+build-backend = "poetry.core.masonry.api"
diff --git a/experiments/exp2025_04_07_testing_graph_coverage/tests/__init__.py b/experiments/exp2025_04_07_testing_graph_coverage/tests/__init__.py
diff --git a/experiments/exp2025_05_05_graph_coverage_class/README.md b/experiments/exp2025_05_05_graph_coverage_class/README.md
@@ -0,0 +1,13 @@
+# Graph coverage + utterances similarities
+
+## Goal
+
+The goal is to develop an algorithm that will select the minimum number of dialogs required to completely cover the graph. Additionally, the most diverse dialogs should be selected from the dialogs with one path.
+
+## Results
+
+Basic steps for an algorithm for covering a graph with the most diverse dialogs have been developed. The starting dialog is the dialog with the maximum number of unique nodes and edges. New path to add is selected by the maximum number of new nodes and edges. New dialog to add is selected by the least similarities between shared elements of the dialogs.
+
+## Future plans
+
+In the future, it is planned to add this algorithm into dev branch as a new class. 
diff --git a/...riments/exp2025_05_05_graph_coverage_class/exp2025_05_05_graph_coverage_class/__init__.py b/...riments/exp2025_05_05_graph_coverage_class/exp2025_05_05_graph_coverage_class/__init__.py
diff --git a/...5_05_05_graph_coverage_class/exp2025_05_05_graph_coverage_class/functions_for_class.ipynb b/...5_05_05_graph_coverage_class/exp2025_05_05_graph_coverage_class/functions_for_class.ipynb
diff --git a/...h_coverage_class/exp2025_05_05_graph_coverage_class/making_class_for_graph_coverage.ipynb b/...h_coverage_class/exp2025_05_05_graph_coverage_class/making_class_for_graph_coverage.ipynb
diff --git a/experiments/exp2025_05_05_graph_coverage_class/poetry.lock b/experiments/exp2025_05_05_graph_coverage_class/poetry.lock
diff --git a/experiments/exp2025_05_05_graph_coverage_class/pyproject.toml b/experiments/exp2025_05_05_graph_coverage_class/pyproject.toml
@@ -0,0 +1,16 @@
+[project]
+name = "exp2025-05-05-graph-coverage-class"
+version = "0.1.0"
+description = ""
+authors = [
+    {name = "dariaolshevskaya",email = "olshevskaya.d@bk.ru"}
+]
+readme = "README.md"
+requires-python = ">=3.11"
+dependencies = [
+]
+
+
+[build-system]
+requires = ["poetry-core>=2.0.0,<3.0.0"]
+build-backend = "poetry.core.masonry.api"
diff --git a/experiments/exp2025_05_05_graph_coverage_class/tests/__init__.py b/experiments/exp2025_05_05_graph_coverage_class/tests/__init__.py