From 88c2ee5f27c115f7f84922a58e02a8c658047c4f Mon Sep 17 00:00:00 2001 From: Antti H S Laaksonen Date: Sun, 5 Feb 2017 01:04:18 +0200 Subject: [PATCH] Corrections --- luku11.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/luku11.tex b/luku11.tex index dfbb1d8..d255972 100644 --- a/luku11.tex +++ b/luku11.tex @@ -1,7 +1,7 @@ \chapter{Basics of graphs} Many programming problems can be solved by -interpreting the problem as a graph problem +modelling the problem as a graph problem and using an appropriate graph algorithm. A typical example of a graph is a network of roads and cities in a country. @@ -11,7 +11,7 @@ in the problem and it can be difficult to detect it. This part of the book discusses graph algorithms, especially focusing on topics that are important in competitive programming. -In this chapter, we go through terminology +In this chapter, we go through concepts related to graphs, and study different ways to represent graphs in algorithms.