From 0e8df7ac5e21a834bd6d7c39ca5646db36fdb7d5 Mon Sep 17 00:00:00 2001 From: anebz Date: Fri, 27 Sep 2019 20:02:45 +0200 Subject: [PATCH] image resizing with html v2 --- 04. Trees and graphs/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/04. Trees and graphs/README.md b/04. Trees and graphs/README.md index d8df374..7865b57 100644 --- a/04. Trees and graphs/README.md +++ b/04. Trees and graphs/README.md @@ -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' - +