<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Thomas Cormen</style></author><author><style face="normal" font="default" size="100%">Charles Leiserson</style></author><author><style face="normal" font="default" size="100%">Ronald Rivest</style></author><author><style face="normal" font="default" size="100%">Clifford Stein</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Section 24.3: Dijkstra's algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Introduction to Algorithms</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><edition><style face="normal" font="default" size="100%">Second</style></edition><publisher><style face="normal" font="default" size="100%">MIT Press and McGraw–Hill</style></publisher><pages><style face="normal" font="default" size="100%">595-601</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>