# weighted directed graph

Not what you're looking for?

Give an example of a weighted directed graph with at most 5 vertices such that Dijkstra's algorithm will NOT give the correct results for the shortest path lengths from source s to every other vertex. Your graph may have negative edge weights but NO negative weight cycles. Indicate what answer Dijkstra's algorithm would give and what the correct answer should be.

##### Purchase this Solution

##### Solution Summary

An example of a weighted directed grap is given.

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

##### C++ Operators

This quiz tests a student's knowledge about C++ operators.

##### Javscript Basics

Quiz on basics of javascript programming language.

##### C# variables and classes

This quiz contains questions about C# classes and variables.

##### Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.