sentences:  The vertices contain information required by the comparison heuristic, while the edges indicate connected 'neighbors'.An algorithm traverses the graph, labeling the vertices based on the connectivity and relative values of their neighbors.Connectivity is determined by the medium; image graphs, for example, can be 4-connected neighborhood or 8-connected neighborhood.