Corrections
This commit is contained in:
parent
5446ed04dd
commit
88c2ee5f27
|
@ -1,7 +1,7 @@
|
||||||
\chapter{Basics of graphs}
|
\chapter{Basics of graphs}
|
||||||
|
|
||||||
Many programming problems can be solved by
|
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.
|
and using an appropriate graph algorithm.
|
||||||
A typical example of a graph is a network
|
A typical example of a graph is a network
|
||||||
of roads and cities in a country.
|
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,
|
This part of the book discusses graph algorithms,
|
||||||
especially focusing on topics that
|
especially focusing on topics that
|
||||||
are important in competitive programming.
|
are important in competitive programming.
|
||||||
In this chapter, we go through terminology
|
In this chapter, we go through concepts
|
||||||
related to graphs,
|
related to graphs,
|
||||||
and study different ways to represent graphs in algorithms.
|
and study different ways to represent graphs in algorithms.
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue