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

  • SEARCH
  • Home
  • 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 6685151
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T05:01:31+00:00 2026-05-26T05:01:31+00:00

I am trying to write graph class as a template class. As answered in

  • 0

I am trying to write graph class as a template class. As answered in Question, I was trying to implement graph in term of std::set , here is what I have wrote till now.

    #include <set>

    template <class T, 
            class Container = std::set<T> >
    class graph {
    public:
        class iterator { 
        public:
            iterator() {
                std::set<T>::iterator();
            }
            iterator(const iterator&) {
                std::set<T>::iterator();
            }
            ~iterator() {
                std::set<T>::~iterator();
            }

What I am looking for here is whenever graph::itertor is called, internally it should called set::iterator, Is this approach ok, and why ~iterator() is not getting compiled.

  • 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-26T05:01:32+00:00Added an answer on May 26, 2026 at 5:01 am

    I think you want to provide iterators for your graph class, and graph’s iterators are nothing but the iterators of the underlying container type. If so, then you should actually be doing this,

    template <class T,  class Container = std::set<T> >
    class graph 
    {
    public:
        typedef typename Container::iterator iterator;
        typedef typename Container::const_iterator const_iterator;
    
        //...
    };
    

    As for your code, I would say that std::set<T>::iterator() creates a temporary object, and the temporary gets destroyed at the end of the full expression. It’s story ends there. And std::set<T>::~iterator() wouldn’t even compile.

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

Sidebar

Related Questions

I'm trying to write a graph class I can use in Android(I'm aware pre-made
I am trying to write a scientific graph library, it works but I have
I'm trying to write a wrapper around Image_Graph bar charts. I actually wrote the
I'm trying write a query to find records which don't have a matching record
Im trying to write something to get my images to show correctly. I have
I'm trying to use XMLEncoder to write an object graph (tree in my case)
I am trying to explore a graph here but I am not sure what
I'm trying to write code that will traverse an undirected, unweighted graph. Essentially, the
I'm trying to write an algorithm that will find the set of all vertices
I am trying to display a simple graph using pydot. My question is that

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.