Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit d395754

Browse files
Refactor diagram to use mermaid
Closes GH-74. Reviewed-by: Titus Wormer <tituswormer@gmail.com>
1 parent 26f0395 commit d395754

File tree

1 file changed

+6
-16
lines changed

1 file changed

+6
-16
lines changed

‎readme.md‎

Lines changed: 6 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -349,22 +349,12 @@ Tree traversal is typically either *breadth-first* or *depth-first*.
349349

350350
In the following examples, we’ll work with this tree:
351351

352-
```ascii
353-
+---+
354-
| A |
355-
+-+-+
356-
|
357-
+-----+-----+
358-
| |
359-
+-+-+ +-+-+
360-
| B | | F |
361-
+-+-+ +-+-+
362-
| |
363-
+-----+--+--+ |
364-
| | | |
365-
+-+-+ +-+-+ +-+-+ +-+-+
366-
| C | | D | | E | | G |
367-
+---+ +---+ +---+ +---+
352+
```mermaid
353+
graph TD
354+
A-->B-->C
355+
B-->D
356+
B-->E
357+
A-->F-->G
368358
```
369359

370360
###### Breadth-first traversal

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /