Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
Libraries like Boost or SNAP provide graph data structures but are quite complicated. I am new to C++ STL and looking for a simple Adjacency List based undirected graph representation. Googling got me nothing thats fits the bill. However, this problem seems quite standard and I think I can skip reinventing the wheel for my project.
C++ on its own, doesn't offer any graph class that you might use. If you don't want to reinvent the wheel (which is a good thing), the only way to achieve what you wish is using an additional library.
If you need something simple, maybe using std::map could suffice. If you need something more advanced, try:
template <typename key_type, typename val_type>
class graph{
std::map<key_type,val_type> nodes;
std::set<std::pair<key_type,key_type> > connections;
};
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 1 year ago.
Improve this question
I was looking for C++ implementation of 2-3-4 Trees online and was surprised that
There is no code available for it. I couldn't find anything. I have studies this Trees
But writing code is difficult for me as of now so I wanted to look at some already
implemented code. Is there an easy way to implement it using a 2-3 Tree or some other
existing Data Structure or one has to start from scratch to implement it ?
Any links/references or ideas will help
You're unlikely to find a production-quality implementation. A red-black tree is an isomorphic structure to a 2-3-4 tree, and is more efficient and easier to work with. So you'll find plenty of RB trees, and they're basically the same thing. (You could rework a RB tree into a 2-3-4 tree but that would just make it worse.)
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
I need to keep my data in associative table. Something like:
typedef std::map< point, std::list<h_stat> > hm;
But STL containers do not have a ready serialization methods. It is very sad news.
I think, it is not a good idea to link a boost library to my small project.
I program on Windows. Maybe, does windows.h or MFC have a associative table class, that has a serialization method from a box? Or is there another good container for C++ on the Internet?
Thank you in advance.
With MFC you definitively have an easy way for serialisation with CMap and very easy way to make classes serializable.
However it's not so portable. An alternative is boost, which provides for serialisation also for standard containers (see also this answer to a similar question)
s11n is a C++ serialization library which claims that it...
can easily serialize all manner of PODs (Plain Old Data types), most STL containers, and user-defined Serializable types.
You could consider using it (AFAIK, it serializes containers automatically from serialization of constituents).
Otherwise, since your project is small, you should be able (without s11n) to manually add serialization operations to every class. With C++11 it should be relatively easy (thanks to ranged for loops, auto, lambda-expressions).
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
How might one implement data frame in R, Python, and other languages using C++?
In general, data.frame solves a problem which is solved fundamentally differently in C++ (and other languages) – namely via class hierarchies, or, in the simplest case, via a vector of tuples.
Since you haven’t given specifics it’s hard to know what exactly you are after but if it’s ease of computation, Armadillo is a good linear algebra library for C++ (one among many). I haven’t yet found a good statistics framework for C++ – I suggest simply sticking with R for that.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 2 years ago.
Improve this question
In my personal c++ studies, I've focused on projects that 1) Keep me engaged and 2) Help teach a standard principle. I want to do a project with database access. Which libraries do you think best stick with the c++ programming paradigm?
I understand that this question is open to interpretation, so please elaborate on your choice.
You might consider using the Database Template Library.
It provides a clean, iterator-based interface to access collections of records, so you can use it with all of the Standard Library algorithms. It also does a pretty good job of limiting the boilerplate you need to write to map database entities to user-defined types in your project.
I'm a fan of OTL (http://otl.sourceforge.net/) which also provides a clean, STL-like interface. It's worked for my needs and is simple to use.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I recall learning about the corner-stitched data structure a number of years ago and have been fascinated with it ever since. It originated with a paper by Ousterhout.
I've searched and not been able to find a free/open implementations. I'd prefer a C++ implementation, but at this point would accept any pointers people might have.
Note: a corner-stitched data structure is a way to store 2 dimensional, rectangluar data, explicitly maintaining the whitespace between inserted elements. This is as opposed to a quad-tree which just stores the inserted data elements. There are many trade-offs, I'm mostly interested in an implementation - but would also accept alternatives that have similar properties.
Ousterhout's own software package Magic implements corner stitching. The C source code is available BSD-licensed at http://opencircuitdesign.com/magic.