<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-28T10:13:25Z</responseDate>
  <request verb="GetRecord" identifier="oai:meral.edu.mm:recid/00008432" metadataPrefix="oai_dc">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/00008432</identifier>
        <datestamp>2022-12-02T05:22:16Z</datestamp>
        <setSpec>1582963788001:1582966516414</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>"Observation of Shortest Paths from Mahamuni Pagoda to Aung Dawmuu Pagoda in Mandalay City"</dc:title>
          <dc:creator>Nang Yu Yu Win</dc:creator>
          <dc:creator>Mon Yee Aye</dc:creator>
          <dc:description>"Firstly, Dijkstra’s algorithm of Graph theory is studied. Then the twelve famous pagodas in
Mandalay city are stated. And then, the shortest path is calculated on our problem by graph.
Finally, the shortest path to visit the famous pagodas in Mandalay City is described"</dc:description>
          <dc:date>2022-08-12</dc:date>
          <dc:identifier>https://meral.edu.mm/records/8432</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
