No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
I am trying to create a graph from a 2d matrix of booleans. When the index [i][j] == 1, I need to create a link or edge from node[i] to node[j]. I am doing some thing wrong. I have created a class file with a struct node and some basic … |
|
|
It is to my understanding when inserting a node to a binary search tree, the data element of the new node is compared to the data element of the node that will be the parent. Now that I have a Ternary Search Tree with two data elements and three keys …
|
|
|
//Cursor.h [code=c] #ifndef CURSOR_H #define CURSOR_H #include <stdlib.h> #include <iostream> template <class Object> class Cursor; // Incomplete Declaration template <class Object> class CNode { public: CNode( const Object & theElement = Object( ), CNode * n = NULL ) : element( theElement ), next( n ) { } Object element; …
|
|
|
I am trying to check the customers request against the volume remaining in the tank. If the request is greater, I need to instruct the customer to move to the next tank. But I am having problems. The tank is set to store 100 gallons. On the 1st request, I …
|
|
|
In this snippet of code, I am trying to check the customers request against the volume remaining in the tank. If the request is greater, I need to instruct the customer to move to the next tank. But I am having problems. The tank is set to store 100 gallons. … 
|
|
|
