Emphasis in readmes

espadrine · espadrine · commit db8fccde91f6 · 2015-11-13T20:12:32.000+01:00
diff --git a/Readme.md b/Readme.md
@@ -3,22 +3,22 @@
 All known problems can be solved with algorithms. For all we know, humans are
 Turing machines.
 
-Most problems can be structured into a graph. Graphs have vertices (entities
+Most problems can be structured into a **graph**. Graphs have vertices (entities
 holding data) and edges (from one vertex to another, sometimes with a value).
 
-Many problems can be structured into a tree. Trees are connected graphs without
-cycles. Most trees we use are rooted: one vertex is the entry point (the root);
-it is the only vertex with no edge pointing to it, all other have exactly one.
-Many trees are ordered: vertices order their children like a list.
+Many problems can be structured into a **tree**. Trees are connected graphs
+without cycles. Most trees we use are rooted: one vertex is the entry point (the
+root); it is the only vertex with no edge pointing to it, all other have exactly
+one. Many trees are ordered: vertices order their children like a list.
 
-Some problems can be structured into a list. Lists are rooted trees where a
+Some problems can be structured into a **list**. Lists are rooted trees where a
 maximum of one child is allowed.
 
-A few problems can be structured into a map. Maps are directed graphs where
+A few problems can be structured into a **map**. Maps are directed graphs where
 every vertex has either a single edge coming from them (keys) or at least one
 edge coming from a key (values).
 
 (An uncommon variation of maps are multimaps, where keys can have more than a
 single edge coming from them.)
 
-Another structure is a set. Sets are graphs with no edges.
+Another structure is a **set**. Sets are graphs with no edges.
diff --git a/tree/Readme.md b/tree/Readme.md
@@ -1,9 +1,9 @@
 Trees are connected graphs without cycles.
 
-Most trees we use are rooted: one vertex is the entry point (the root);
+Most trees we use are **rooted**: one vertex is the entry point (the root);
 it is the only vertex with no edge pointing to it, all other have exactly one.
 
-Many trees are ordered: vertices order their children like a list.
+Many trees are **ordered**: vertices order their children like a list.
 
 The most common implementation of trees is as either null pointers or pointers
 to a structure with a value and a list of children trees.
@@ -67,7 +67,7 @@ Rarer, it ensures that recently requested searches are faster to search for.
 Great for priority queues. Efficient to implement as an array.
 
 - Complete binary tree: all levels of the tree must be filled but the bottom.
-- Each value stored in a vertex is bigger or equal to its children.
+- Each value stored in a vertex is bigger than or equal to its children.
 
 # B-tree
 
