Purchase Solution

weighted directed graph

Not what you're looking for?

Ask Custom Question

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.

View More Free Quizzes
Related BrainMass Solutions

  • parent array produced by Dijkstra's algorithm

    20213 parent array produced by Dijkstra's algorithm Here is a proposed algorithm to solve the single source shortest paths problem in a weighted directed graph G with possibly negative edges weights, but no negative weight cycles: Form the graph G'

  • BFS, DFS, DAGs, Topological sorting, and Dijkstra

    In graph theory, a topological sort of a directed acyclic graph (DAG) is a linear ordering of its nodes which is compatible with the partial order R induced on the nodes where x comes before y (xRy) if there's a directed path from x to y in the DAG.

  • neural network

    It is represented by a labeled, directed graph structure, where nodes perform some simple computations. Each node represents a neuron, and each directed edge represents a weighted connection between two nodes.

  • modify the Bellman-Ford algorithm

    20214 Modifying the Bellman-Ford Algorithm Show how to modify the Bellman-Ford algorithm to find and print a negative weight cycle (reachable from the source, s) in a weighted directed graph G if one exists.

  • Directed graphs

    The directed graph is shown below. The adjacency matrix is This shows how to find the corresponding directed graph and adjacency matrix for a given relation.

  • Directed Graphs and Trees

    24262 Directed Graphs and Trees A. Is a directed graph weakly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph? b.

  • A directed graph

    344321 Draw a graph with numbered and directed edges. Problem 6.

  • Connected Graph

    40070 Connected Graph See attached For the given directed graph, find the following: a. A directed path from A to E. A->C->D->E b. Two directed paths from C to F: C->D->F, C->B->F c. A directed path from E to A: E->B->A

  • Topological Sorting

    73576 Topological Sorting An algorithm for computing a topological ordering of a DAG (Directed Acyclic Graph) repeatedly finds a node with no incoming edges and deletes it.

View More Related Solutions