Update README.md
Browse files
README.md
CHANGED
@@ -5,21 +5,29 @@ language:
|
|
5 |
- en
|
6 |
widget:
|
7 |
- text: "Dijkstra's algorithm is an algorithm for finding the [MASK] paths between nodes in a weighted graph"
|
8 |
-
example_title: "
|
9 |
-
|
10 |
-
|
11 |
-
|
12 |
-
|
13 |
-
- text: "
|
14 |
-
example_title: "
|
15 |
-
|
16 |
-
|
17 |
-
|
18 |
-
|
19 |
-
- text: "
|
20 |
-
example_title: "
|
21 |
-
|
22 |
-
|
23 |
-
|
24 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
25 |
---
|
|
|
5 |
- en
|
6 |
widget:
|
7 |
- text: "Dijkstra's algorithm is an algorithm for finding the [MASK] paths between nodes in a weighted graph"
|
8 |
+
example_title: "example 6 - Djikstra"
|
9 |
+
|
10 |
+
- text: "This concludes the [MASK]."
|
11 |
+
example_title: "example 0 a"
|
12 |
+
|
13 |
+
- text: "We show this by [MASK]."
|
14 |
+
example_title: "example 0 b"
|
15 |
+
|
16 |
+
- text: "By [MASK]'s inequality."
|
17 |
+
example_title: "example 7 - inequalities"
|
18 |
+
|
19 |
+
- text: "The [MASK] is definite positive."
|
20 |
+
example_title: "example 1"
|
21 |
+
|
22 |
+
- text: "* In particular any field is a [MASK]."
|
23 |
+
example_title: "example 2"
|
24 |
+
|
25 |
+
- text: "* To determine the shortest distance in a graph, one can use [MASK]'s algorithm."
|
26 |
+
example_title: "example 3 - algorithm specific"
|
27 |
+
|
28 |
+
- text: "* An illustration of the superiority of quantum computer is provided by [MASK]'s algorithm."
|
29 |
+
example_title: "example 4 - algorithm name"
|
30 |
+
|
31 |
+
- text: "* One of the ways of avoiding [MASK] is using cross validation, that helps in estimating the error over test set, and in deciding what parameters work best for your model."
|
32 |
+
example_title: "example 5 - Machine learning"
|
33 |
---
|