Dijkstra's algorithm 01

Hello I checked your program. The problem seems to be in the function: int Weighted_graph::findnextminvertex(double *dis ,int m,bool *visited) If you select me we can discuss this. Best Regards

Hi there, I do C++ programming and have done Dijkstra before. I checked the code and I can fix this for you if you are interested. Let me know if you are interested.

hi. i have a lot of experience in debugging C/C++ programs and fixing seg faults . i can easily complete this project for you. we can have a chat. thanks

I am very proficient in c and c++. I have 16 years c++ developing experience now, and have worked for more than 7 years. My work is online game developing, and mainly focus on server side, using c++ under Linux environment. I made many great projects using c++, for example, I made the tools which could convert java codes into c++ scripts, of course garbage collection included, this was very similar to a compiler, and was very complex. I also made our own mobile game using c++, I can show you the demo of client, if you like. I am very proficient in java also. I have a very good review on Freelancer.com, I never miss a project once I accept the job, you can check my review. Trust me, please let expert help you.

Hi , I am experienced C++ programmer and I can help you with fixing this code. Please provide more details in the private chat - like full code, the program you are using it with and test data that causes failure. You can leave me messages even if I am offline, I will read them as soon as I can.

HY I am software engineer and have delivered many programming projects. You can share more details in chat. Thank you

Hi, I've got quite some experience with C++ and I'm sure I can help you out here. May I get some more details over the chat?

Hello We are highly motivated young technocrats from India. We are approachable, you can come to us if you have a struggle, we are happy to help. Team TiponTongue

Hi, I can help you out in fixing the problem. Let me know when you're available so we may discuss it in detail. Thanks, Adeel

Hello, read your description and i've recently completed few task on dijkstra algo. I'm sure i can help you fix this task as well. We can discuss further details in pm. looking forward to hear back from you. kind regards, zeeshan Ahmed

Hi Weighted_graph Has no closing } Bract .. thanks .. ............................................. .........

Hi! I recently did a project with similar requirements. So it would be interesting to work on it again. Best regards!

Hello, I am a graduate student with more than 5 years in computer graphics. My research topic is about Dijkstra's algorithm and its applications. I believe that my knowledge is what you need for your project. Thanks

I have over 2 years of experience with c++ and have encountered segmentation faults tons of times. I believe I can fix it in less than a day, but worst case scenario it could take a little while. I have also worked a bunch with the algorithm, so it wouldnt take much me time to understand the background of the issue. I hope it suits what you are looking for. Update 1: I just saw you attached the file. Ima give it a look, haha. Update 2: I've seen the code, I have a few ideas on what might be causing you problems. I'd be happy to give you my Skype or Discord to talk about them and explain what I understand about those issues, so that you don't only get the program running, but also understand what is wrong and solve it by your self next time :D