# Implementing a shortest path algorithm in C

**URL:** <https://community.unix.com/t/implementing-a-shortest-path-algorithm-in-c/272477>\
**Category:** Programming\
**Created:** [August 30, 2010, 7:32pm UTC](https://community.unix.com/t/implementing-a-shortest-path-algorithm-in-c/272477 "2010-08-30T19:32:06Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![mind](https://community.unix.com/letter_avatar/mind/32/5_5575768a8748004e209b776fc1b2916d.png) [@mind](https://community.unix.com/u/mind)\
**Post date:** [August 30, 2010, 7:32pm UTC](https://community.unix.com/t/implementing-a-shortest-path-algorithm-in-c/272477/1 "2010-08-30T19:32:06Z")

</div>

Hello,

I have a question. I have to implement a shortest path algorithm in n\*n grid, moving from one coordinate to another coordinate.

But i have no clue how to start. Can anyone help?

Thanks a tonn in advance!

---

<div class="post-metadata">

**Author:** ![pludi](https://community.unix.com/user_avatar/community.unix.com/pludi/32/1278_2.png) [@pludi](https://community.unix.com/u/pludi)\
**Post date:** [August 31, 2010, 3:41am UTC](https://community.unix.com/t/implementing-a-shortest-path-algorithm-in-c/272477/2 "2010-08-31T03:41:12Z")

</div>

Check out [A\* Pathfinding for Beginners](http://www.policyalmanac.org/games/aStarTutorial.htm).