From 09ef8c1cc8e95c25fbb846606a1d9564e3ec7f9f Mon Sep 17 00:00:00 2001 From: Milad Irannejad Date: Wed, 17 Jan 2024 23:45:36 -0500 Subject: [PATCH] Update package documentation --- automata/README.md | 1 - graph/README.md | 3 +-- heap/README.md | 1 - list/README.md | 1 - sort/README.md | 1 - symboltable/README.md | 1 - trie/README.md | 2 -- 7 files changed, 1 insertion(+), 9 deletions(-) diff --git a/automata/README.md b/automata/README.md index 6056e59..a78604b 100644 --- a/automata/README.md +++ b/automata/README.md @@ -1,4 +1,3 @@ -# automata Finite automata are recognizers; they simply say yes or no for each possible input string. They come in two flavors: diff --git a/graph/README.md b/graph/README.md index 75ff159..36148b9 100644 --- a/graph/README.md +++ b/graph/README.md @@ -1,6 +1,5 @@ -# graph -## Test Graphs +The example graphs used in test files are shown below. ### Undirected diff --git a/heap/README.md b/heap/README.md index 96264cc..2fb038d 100644 --- a/heap/README.md +++ b/heap/README.md @@ -1,4 +1,3 @@ -# heap | Heap | Description | |------|-------------| diff --git a/list/README.md b/list/README.md index 01571af..3619c9a 100644 --- a/list/README.md +++ b/list/README.md @@ -1,4 +1,3 @@ -# list | Data Structure | Description | |----------------|---------------------------| diff --git a/sort/README.md b/sort/README.md index 95cfbf6..0632150 100644 --- a/sort/README.md +++ b/sort/README.md @@ -1,4 +1,3 @@ -# sort | Sort | Best Case | Average Case | Worst Case | Memory | Comment | |-----------|:-----------------:|:-----------------:|:-----------------:|:------:|-----------------------------------------------| diff --git a/symboltable/README.md b/symboltable/README.md index fd08e0f..c830630 100644 --- a/symboltable/README.md +++ b/symboltable/README.md @@ -1,4 +1,3 @@ -# st This package provides implementations for **symbol table** data structures. diff --git a/trie/README.md b/trie/README.md index 80bc5fe..c98a117 100644 --- a/trie/README.md +++ b/trie/README.md @@ -1,5 +1,3 @@ -# trie - This package provides implementations for **prefix tree** a.k.a. **trie** data structures.