cleanup winner README.md files

Fixed cases where there was a bad trailing backslash.

Improved a few cases where a code block was needed
to highlight some text.

Changed a few cases where a code block needed to
declared as, say, a sh code block.

Fixed a few cases where the winner information was not properly formatted.

Plus a few nits and clarifying text was added.
This commit is contained in:
Landon Curt Noll committed 2023-11-04 03:21:11 -07:00
1 parent 394f710bc3
commit 360708f858
120 files changed
+1198 -1024

No files matched your search

+3 -3
View File
@@ -54,14 +54,14 @@ movement as one step?
## Author's remarks:
### The Program:
\
This program is pretty simple! It performs a breadth first search on the
specified graph. The graph can be any ascii text file that has an 'at'
character, which is going to be the starting location, and a '!' character
which will be the destination.
The nodes on this graph that are spaces are connected with any directly
adjacent nodes that are also spaces. Nodes that aren't spaces are not\
adjacent nodes that are also spaces. Nodes that aren't spaces are not
connected with anything.
### Compiling and Running:
@@ -83,7 +83,7 @@ cat <input file> | ./tbfs
Examples:
```sh
./tbfs < maze\
./tbfs < maze
./tbfs < prog.c
```