Shrey commited on
Commit
09d5ffb
·
1 Parent(s): 89126c3

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +25 -17
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: "Dijkstra"
9
- - text: "This concludes the [MASK]. Possible options include proof, lemma, claim, theorem, case, or thesis."
10
- example_title: "test1"
11
- - text: "We show this by [MASK]. Possible options include induction, definition, a, lemma, or contradiction."
12
- example_title: "test2"
13
- - text: "By [MASK]'s inequality. Possible options include Jensen, Holder, Young, Minkowski, or Cauchy."
14
- example_title: "test3"
15
- - text: "The [MASK] is definite positive. Possible options include inequality, case, limit, sum, or function."
16
- example_title: "test4"
17
- - text: "* In particular any field is a [MASK]. Possible options include 1, group, f, or field."
18
- example_title: "test5"
19
- - text: "* To determine the shortest distance in a graph, one can use [MASK]'s algorithm. Possible options include Dijkstra, Grover, Tarjan, Newton, or Hamilton."
20
- example_title: "test6"
21
- - text: "* An illustration of the superiority of quantum computer is provided by [MASK]'s algorithm. Possible options include Grover, Shor, Dijkstra, Yao, or Kitaev."
22
- example_title: "test7"
23
- - 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. The possible option for the MASK is 'overfitting.'"
24
- example_title: "test8"
 
 
 
 
 
 
 
 
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
  ---