Shortest path problemIn graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment.
Linear integrated circuitA linear integrated circuit or analog chip is a set of miniature electronic analog circuits formed on a single piece of semiconductor material. The voltage and current at specified points in the circuits of analog chips vary continuously over time. In contrast, digital chips only assign meaning to voltages or currents at discrete levels. In addition to transistors, analog chips often include a larger number of passive elements (capacitors, resistors, and inductors) than digital chips.
