I want to create a maze and solve it using djikstra's algorithm

I'm computer engineering TA with 10+ years of experience. Experienced with Java and JavaFX SE,ME under netbeans,eclipse,JCreator Experienced with data structures and algorithms , computation theory , discrete math and competitive programming I'm experienced also with the queues - stacks - linked list - trees - graph algorithms DFS - BFS - Dijkstra - primes's - heap - heap sort - binary heap - fibonacci heap Will provide you fully commented code + any required documentations

HI..i am proficient in core Java OO programming along with data structures, algorithms and can help you write code for solving maze problems using djikstra's algorithm.

Hi, I am a professional programmer and trader and will give you the best work I have innovative tech mind with 10 years of experience working as a computer programmer. Capable of working with a variety of technology and software solutions and managing databases. The valuable team member who has experience diagnosing problems and developing solutions. Extensive expertise in networking systems and working with mainframe computers. A talented leader with unique ideas and a history of successful contributions in the field. -Solid background and advanced knowledge in computer development software including C++, Java, PHP, Java script,Python, R, Spark, Visual Basic, and Maven. -Skilled in working with database management tools such as MySQL, Hadoop, Sybase, and MongoDB. -Highly organized with an exceptional commitment to task completion and quality assurance when working with computer software programs. -Committed to delivering company objectives to projects and results to customers and improving each version of the software I engage with. -Ability to solve complex problems successfully with minimal guidance or help using a logical reasoning technique and strong attention to detail. Inbox me for more details. Thanks

Dear client, Thank you for this job posting! Even though this task does not seem to be a challenging one, I find it pretty interesting. I am not bounded now; therefore, I can start right away, just send me the full task description for it! Anyway, looking forward to working with you! Best regards, Anton Danylov