The latest articles on DEV Community by triedonwatch (@tiredonwatch). https://dev.to/tiredonwatch https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1478500%2Fde25d783-6c4a-49fe-abce-7027105a7461.jpg https://dev.to/tiredonwatch en triedonwatch Mon, 17 Jun 2024 08:04:56 +0000 https://dev.to/tiredonwatch/a-algorithm-in-one-byte-2l5i https://dev.to/tiredonwatch/a-algorithm-in-one-byte-2l5i <p><em>This is a submission for <a href="https://dev.to/challenges/cs">DEV Computer Science Challenge v24.06.12: One Byte Explainer</a>.</em></p> <h2> Explainer </h2> <p>A* is a path finding algorithm, given a weighted graph, source node, goal node, the algorithm finds shortest path from source to goal according to the given weights. It's used in Network Routing, Video Game NPCs, Route Planning </p> <h2> Additional Context </h2> <p>Weighted Graph- A Graph whose edges have been assigned numbers(weights)</p> devchallenge cschallenge computerscience beginners