September 2018
Intermediate to advanced
288 pages
7h 38m
English
As anticipated at the beginning of this chapter, what we will face is an optimization problem or (what is the same) we will try to identify the shortest path. Graphs are data structures that are widely used in optimization problems. A graph is graphically represented by a vertex and edge structure. The vertices can be seen as events from which different alternatives (the edge) depart. Typically, graphs are used to represent a network in an unambiguous way: vertices represent individual calculators, road intersections, or bus stops, and edges are electrical connections or roads. Edges can connect vertices in any way possible.
Read now
Unlock full access