silva
/
ctci
mirror of https://github.com/viniciusfdasilva/ctci.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

4. README graph v3.75 

this should work https://gist.github.com/uupaa/f77d2bcf4dc7a294d109
This commit is contained in:
anebz 2019-09-26 20:48:34 +02:00
parent 84478fe8e9
commit 2568418171
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
04. Trees and graphs/README.md
View File

@ -170,7 +170,7 @@ The actual implementation of these * nodes can be a special type of child, like
A node in a trie can have anywhere from 1 through `alphabet_size + 1` children.
![trie](img/trie.png){width:300}
![trie](img/trie.png | width=300)
Commonly, a trie is used to store the entire (english) language for quick prefix lookups. While a hash table can quickly look up whether a string is a valid word, it can't tell if a string is a prefix of any valid words.
@ -184,4 +184,4 @@ A tree is a type of graph, but not all graphs are trees. A tree is a connected g
* The graph can have multiple isolated subgraphs. If there's a path between every pair of vertices, it's called a 'connected graph'
* The graph can also have cycles. If it doesn't, it's called 'acyclic'
![graph](img/graph.png){width:300}
![graph](img/graph.png | width=300)