StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POC++ while using priority queue Debug assertion failed, Expression: invalid heap
primarykey
Id
5852545
data
AcceptedAnswerId
0
AnswerCount
3
ClosedDate
CommentCount
4
CommunityOwnedDate
CreationDate
2011-05-02T00:49:46.657
FavoriteCount
0
LastActivityDate
2015-08-25T21:04:57.380
LastEditDate
LastEditorUserId
0
OwnerUserId
732856
ParentId
0
PostTypeId
1
Score
2
ViewCount
4801
LastEditorDisplayName
text
Body
Environment: - Win7 pro x64 - VS2010 - C++ - Empty Project Goal: Implementation of Dijkstra's shortest path algo using a priority queue. Problem: When the program runs it gets a Debug assertion failed, Expression: invalid heap error. If the user inputs the source vertex as 1, everything works fine. The assertion only occurs when the source vertex is other than 1. Also, if the assertions are ignored, the code finishes eventually and outputs the proper paths through the graph. I am guessing the error has something to do with altering the data that pointers in the priority queue point to, but if this is the case, I don't understand why using 1 as the source allows the code to complete successfully. Thanks for any and all help! header: <pre><code>#ifndef _GRAPH_H_ #define _GRAPH_H_ #include <map> #include <queue> #include <vector> #include <fstream> using namespace std; class Graph { public: struct Vertex { int name; // V number double dv; // distance Vertex* pv; // previous V* from this V map<Vertex*, double> neighbors; // map of all neighbors/distances connected to vert }; vector<Vertex*> verts; // vector of all V* void dijkstra(ifstream& stream, int start_vert); // create graph & find shortest paths void printPath(Vertex* v); // echo path class CompareVert // overloaded compare operator for priorty queue data struct, sort queue so V with smallest dist on top { public: bool operator()(const Vertex* v1, const Vertex* v2) const { return v1->dv > v2->dv; } }; }; #endif </code></pre> implementation: <pre><code>#include "Graph.h" #include <iostream> #include <queue> #include <limits> // used for numeric_limits<double>::infinity() #include <vector> using namespace std; int path_length = 0; void Graph::printPath(Vertex* v) // print shortest paths { if (v->pv != NULL) { printPath(v->pv); cout << " -> "; } cout << v->name; } void Graph::dijkstra(ifstream& stream, int start_vert) // create graph & get shortest path { ///////////////////////////////////////////// /////////////// create graph //////////////// ///////////////////////////////////////////// int total_edges; priority_queue<Vertex*, vector<Vertex*>, CompareVert> q; double infinity = numeric_limits<double>::infinity(); int source; int dest; double dist; stream >> total_edges; for (int i=0;i<total_edges;i++) { stream >> source; stream >> dest; stream >> dist; bool source_exists = false; bool dest_exists = false; Vertex* _source; Vertex* _dest; for (int i=0;i<verts.size();i++) { if (verts.at(i)->name == source) // vertex already exists, set to V { _source = verts.at(i); source_exists = true; break; } } for (int i=0;i<verts.size();i++) { if (verts.at(i)->name == dest) // vertex already exists, set to V { _dest = verts.at(i); dest_exists = true; break; } } if (!source_exists) // create vert { _source = new Vertex; _source->name = source; _source->dv = infinity; _source->pv = NULL; verts.push_back(_source); } if (!dest_exists) // create vert { _dest = new Vertex; _dest->name = dest; _dest->dv = infinity; _dest->pv = NULL; verts.push_back(_dest); } _source->neighbors.insert(pair<Vertex*, double>(_dest, dist)); // populate V's adjacency map } for (int i=0;i<verts.size();i++) { if (verts.at(i)->name == start_vert) // set source { verts.at(i)->dv = 0; } q.push(verts.at(i)); // push all vertices to priority queue } ///////////////////////////////////////////// //////////////// find paths /////////////// ///////////////////////////////////////////// vector<int> displayed; bool print; // flag to call printPath while (!q.empty()) { map<Vertex*, double>::iterator it; Vertex* temp = q.top(); // get V with smallest dist print = true; for (it = temp->neighbors.begin(); it!=temp->neighbors.end();++it) { if ((temp->dv + it->second) < it->first->dv) { print = false; it->first->dv = (temp->dv + it->second); it->first->pv = temp; q.push(it->first); } } for (int i=0;i<displayed.size();i++) // if end V of path has already been printed, do not print { if (displayed.at(i) == temp->name) print = false; } if (print == true) { printPath(temp); path_length = temp->dv; cout << " total distance = " << path_length <<endl << endl; displayed.push_back(temp->name); } path_length = 0; q.pop(); } } </code></pre> driver: <pre><code>#include "Graph.h" #include <stdio.h> #include <iostream> #include <string> #include <fstream> #include <list> using namespace std; string fname; int vname; string line; int main(void) { cout << "Please enter the file to read in a graph (graph.txt): "; cin >> fname; cout << "Please choose a starting vertex (1 is a good choice): "; cin >> vname; cout << endl; ifstream my_stream (fname); Graph my_graph; my_graph.dijkstra(my_stream, vname); my_stream.close(); } </code></pre> graph.txt: <pre><code>12 1 2 2 1 4 1 2 4 3 2 5 10 3 1 4 3 6 5 4 3 2 4 5 2 4 6 8 4 7 4 5 7 6 7 6 1 </code></pre>
Tags
<c++><priority-queue><assertions>
Title
C++ while using priority queue Debug assertion failed, Expression: invalid heap
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USe_r
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POC++ while using priority queue Debug assertion failed, Expression: invalid heap
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 POC++ while using priority queue Debug assertion failed, Expression: invalid heap
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.