Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7639923
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 31, 20262026-05-31T08:32:55+00:00 2026-05-31T08:32:55+00:00

I have a Graph pointer called *graph1 and memory has already been allocated for

  • 0

I have a Graph pointer called *graph1 and memory has already been allocated for it (note: not part of the question but Graph is a template class). I have also created another instance of Graph called graph2. I called an overloaded assignment operator on them like so

Graph<std::string,std::string> *graph1 = new Graph<std::string,std::string>;
...
... // Called member functions on graph1
Graph<std::string,std::string> graph2;
graph2 = *graph1;

The assignment operator works properly, BUT for some reason Graph’s destructor also gets called right after the assignment operator gets called. Is this normal or am I not implementing the assignment operator properly?

This is how I implemented assignment operator:

template <typename VertexType, typename EdgeType>
Graph<VertexType, EdgeType> Graph<VertexType, EdgeType>::operator=(const Graph<VertexType, EdgeType> &source)
{
  std::cout << "\tAssignment Operator called\n\n";
  if(this == &source)
    return *this;

  this->vecOfVertices = source.vecOfVertices;
  this->orderPtr = source.orderPtr;
  this->count = source.count;
  return *this;
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-31T08:32:56+00:00Added an answer on May 31, 2026 at 8:32 am

    The correct definition of assignment operator is

    Graph<VertexType, EdgeType>& Graph<VertexType, EdgeType>::
        operator=(const Graph<VertexType, EdgeType> &source);
    

    By using Graph<VertexType, EdgeType> as your return type, you are generating an unnecessary creation of a temporary variable.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have read the topic about pointer, but i still have some question. //
I know similar questions have been asked before, but still things are not clear
Suppose I have a weighted non-directed graph G = (V,E). Each vertex has a
I have searched this question but didn't get / or understood the answer I
I have a Graph being drawn inside a UIScrollView . It's one large UIView
I have a graph with n nodes as an adjacency matrix . Is it
I have a graph which contains an unknown number of disconnected subgraphs. What's a
I have oriented graph. Graph can be strongly connected. Every vertex can have a
I have a graph created with MS Chart like the following picture. As you
Today I have such graph. I run it on windows (source: narod.ru ) I

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.