nanoll
extt
Contact admin for Full-Text
Please use this identifier to cite or link to this item:
http://lrcdrs.bennett.edu.in:80/handle/123456789/3924Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Verma, Madhushi | |
| dc.contributor.author | Bhardwaj, Arpit | |
| dc.contributor.author | Sharma, Akash | |
| dc.contributor.author | Goyal, Ankush | |
| dc.date.accessioned | 2024-05-30T09:44:28Z | - |
| dc.date.available | 2024-05-30T09:44:28Z | - |
| dc.date.issued | 2023 | |
| dc.identifier.issn | 978-93-5053-898-2 | |
| dc.identifier.uri | http://lrcdrs.bennett.edu.in:80/handle/123456789/3924 | - |
| dc.description.abstract | The "metro Yatra" project offers a C++ solution to determine the shortest path in the complex network of the Delhi Metro system. As the population of the city increases, the development of public transportation is important. The project addresses the need for a smart and fast direction-finding device and uses advanced techniques to calculate peak times between two metro stations in Delhi. | en_US |
| dc.publisher | CYBER TECH PUBLICATIONS | en_US |
| dc.title | Metro Yatra System Using Data Structure | en_US |
| dc.type | Book Chapter | en_US |
| Appears in Collections: | Book Chapters_ SCSET | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| Ch_12_978-93-5053-898-2.pdf Restricted Access | 2.15 MB | Adobe PDF | View/Open Request a copy |
Contact admin for Full-Text
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.