📝 docs: update package descriptions

guanghechen · guanghechen · commit a2455edb5dbf · 2022-02-22T21:11:17.000+08:00
diff --git a/packages/base64/package.json b/packages/base64/package.json
@@ -1,7 +1,7 @@
 {
   "name": "@algorithm.ts/base64",
   "version": "2.0.0",
-  "description": "base64 + Euclidean algorithm",
+  "description": "A Base64 encoding implementation.",
   "author": {
     "name": "guanghechen",
     "url": "https://github.com/guanghechen/"
diff --git a/packages/bellman-ford/package.json b/packages/bellman-ford/package.json
@@ -1,7 +1,7 @@
 {
   "name": "@algorithm.ts/bellman-ford",
   "version": "2.0.0",
-  "description": "Dancing link + Algorithm X",
+  "description": "Bellman-ford algorithm.",
   "author": {
     "name": "guanghechen",
     "url": "https://github.com/guanghechen/"
diff --git a/packages/bipartite-graph-matching/package.json b/packages/bipartite-graph-matching/package.json
@@ -1,7 +1,7 @@
 {
   "name": "@algorithm.ts/bipartite-graph-matching",
   "version": "2.0.0",
-  "description": "Dancing link + Algorithm X",
+  "description": "The algorithm to find the maximum matching of the bipartite graph.",
   "author": {
     "name": "guanghechen",
     "url": "https://github.com/guanghechen/"
diff --git a/packages/dijkstra-bigint/package.json b/packages/dijkstra-bigint/package.json
@@ -1,7 +1,7 @@
 {
   "name": "@algorithm.ts/dijkstra-bigint",
   "version": "2.0.0",
-  "description": "Dancing link + Algorithm X",
+  "description": "Dijkstra algorithm (bigint version) optimized with @algorithm.ts/priority-queue.",
   "author": {
     "name": "guanghechen",
     "url": "https://github.com/guanghechen/"
diff --git a/packages/dijkstra/package.json b/packages/dijkstra/package.json
@@ -1,7 +1,7 @@
 {
   "name": "@algorithm.ts/dijkstra",
   "version": "2.0.0",
-  "description": "Dancing link + Algorithm X",
+  "description": "Dijkstra algorithm optimized with @algorithm.ts/priority-queue.",
   "author": {
     "name": "guanghechen",
     "url": "https://github.com/guanghechen/"
diff --git a/packages/lcs/package.json b/packages/lcs/package.json
@@ -1,7 +1,7 @@
 {
   "name": "@algorithm.ts/lcs",
   "version": "2.0.0",
-  "description": "GCD + Euclidean algorithm",
+  "description": "Find the longest common subsequence.",
   "author": {
     "name": "guanghechen",
     "url": "https://github.com/guanghechen/"

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`{`
`2`	`2`	`"name": "@algorithm.ts/base64",`
`3`	`3`	`"version": "2.0.0",`
`4`		`- "description": "base64 + Euclidean algorithm",`
	`4`	`+ "description": "A Base64 encoding implementation.",`
`5`	`5`	`"author": {`
`6`	`6`	`"name": "guanghechen",`
`7`	`7`	`"url": "https://github.com/guanghechen/"`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`{`
`2`	`2`	`"name": "@algorithm.ts/bellman-ford",`
`3`	`3`	`"version": "2.0.0",`
`4`		`- "description": "Dancing link + Algorithm X",`
	`4`	`+ "description": "Bellman-ford algorithm.",`
`5`	`5`	`"author": {`
`6`	`6`	`"name": "guanghechen",`
`7`	`7`	`"url": "https://github.com/guanghechen/"`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`{`
`2`	`2`	`"name": "@algorithm.ts/bipartite-graph-matching",`
`3`	`3`	`"version": "2.0.0",`
`4`		`- "description": "Dancing link + Algorithm X",`
	`4`	`+ "description": "The algorithm to find the maximum matching of the bipartite graph.",`
`5`	`5`	`"author": {`
`6`	`6`	`"name": "guanghechen",`
`7`	`7`	`"url": "https://github.com/guanghechen/"`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`{`
`2`	`2`	`"name": "@algorithm.ts/dijkstra-bigint",`
`3`	`3`	`"version": "2.0.0",`
`4`		`- "description": "Dancing link + Algorithm X",`
	`4`	`+ "description": "Dijkstra algorithm (bigint version) optimized with @algorithm.ts/priority-queue.",`
`5`	`5`	`"author": {`
`6`	`6`	`"name": "guanghechen",`
`7`	`7`	`"url": "https://github.com/guanghechen/"`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`{`
`2`	`2`	`"name": "@algorithm.ts/dijkstra",`
`3`	`3`	`"version": "2.0.0",`
`4`		`- "description": "Dancing link + Algorithm X",`
	`4`	`+ "description": "Dijkstra algorithm optimized with @algorithm.ts/priority-queue.",`
`5`	`5`	`"author": {`
`6`	`6`	`"name": "guanghechen",`
`7`	`7`	`"url": "https://github.com/guanghechen/"`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`{`
`2`	`2`	`"name": "@algorithm.ts/lcs",`
`3`	`3`	`"version": "2.0.0",`
`4`		`- "description": "GCD + Euclidean algorithm",`
	`4`	`+ "description": "Find the longest common subsequence.",`
`5`	`5`	`"author": {`
`6`	`6`	`"name": "guanghechen",`
`7`	`7`	`"url": "https://github.com/guanghechen/"`