09-05-2010
Quote:
Originally Posted by
vidyaj
hi all,
i need c++ code to print a binary or non binary tree using stl map....
please help me to find the same..........
Show us what have you tried so far.
8 More Discussions You Might Find Interesting
1. Programming
Hi there,
I am using the STL map and I print the map using:
map <string, float> ngram_token_index ;
map <string, float>::iterator map_iter ;
//read the map
...
// print the map
for ( map_iter = ngram_token_index.begin() ; map_iter != ngram_token_index.end() ; map_iter++ )
cout << ... (2 Replies)
Discussion started by: superuser84
2 Replies
2. Programming
Help me please with STL source code that works on Windows
I've found on Inet STL MRU Cache (it compiles fine with Studio 2008), but when trying to build it with Kdevelop (g++ is the compiler) I've got a series of error. One of them I've placed in the source code. If it's important I can post here... (0 Replies)
Discussion started by: Orlando_ua
0 Replies
3. UNIX for Dummies Questions & Answers
Hello,
I'm using RHEL 5.3, I need to compile C++ code and I'd like to know which rpm contains the STL library.
Thanks:) (3 Replies)
Discussion started by: pppswing
3 Replies
4. Programming
class tst
{
public:
tst() {
cout<<"ctor tst()\n";
}
tst(const tst& ob) {
cout<<"cp ctor tst()\n";
}
~tst()
{
cout<<"dtor tst()\n";
}
};
map<string,tst> mp;
int main(void)
{
mp;
//mp=tst();
} (1 Reply)
Discussion started by: johnbach
1 Replies
5. Programming
hi all
i have a tree structure:
root --- node 1 to node 10
in each node --- sub node 1 to sub node 10
in each sub node --- leaf node 1 to leaf node 10
i have to print this in following fashion:
root ---- n1 ---- sn1 ---- l1, l2, l3, ....., l10
n1 ---- sn2 ---- l1, l2, l3,... (2 Replies)
Discussion started by: vidyaj
2 Replies
6. Programming
Hi, guys.
I am working on a project right now. But when I debug my code, I can't see the values in stl container, e.g vector, map. Can anyone help me, please. I am really frustrated:wall:. I am using code::blocks IDE, by the way. Thanks in advance...... (0 Replies)
Discussion started by: tefino
0 Replies
7. Programming
Hi all,
I pass to the transform algorithm two vectors, and the suma function.
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
class Duo{
public:
int one;
int two;
};
Duo suma(Duo first, Duo last){
Duo ret;
... (1 Reply)
Discussion started by: santiagorf
1 Replies
8. UNIX for Dummies Questions & Answers
Hi,
when I run tree command in linux box getting below image, not the line
test
âââ lost+found
âââ test1
â  âââ aaa.txt
â  âââ bbb.txt
âââ test2
3 directories, 2 files
installed tree-1.5.3-2.el6.x86_64 package (8 Replies)
Discussion started by: stew
8 Replies
LEARN ABOUT DEBIAN
tree::simple::visitor::breadthfirsttraversal
Tree::Simple::Visitor::BreadthFirstTraversal(3pm) User Contributed Perl Documentation Tree::Simple::Visitor::BreadthFirstTraversal(3pm)
NAME
Tree::Simple::Visitor::BreadthFirstTraversal - A Visitor for breadth-first traversal a Tree::Simple hierarchy
SYNOPSIS
use Tree::Simple::Visitor::BreadthFirstTraversal;
# create an visitor
my $visitor = Tree::Simple::Visitor::BreadthFirstTraversal->new();
# pass our visitor to the tree
$tree->accept($visitor);
# print our results
print join ", " => $visitor->getResults();
# this will print this:
# 1, 2, 3, 1.1, 1.2, 2.1, 3.1, 1.1.1
# assuming your tree is like this:
# 1
# 1.1
# 1.1.1
# 1.2
# 2
# 2.1
# 3
# 3.1
DESCRIPTION
This implements a breadth-first traversal of a Tree::Simple hierarchy. This can be an alternative to the built in depth-first traversal of
the Tree::Simple "traverse" method.
METHODS
new There are no arguments to the constructor the object will be in its default state. You can use the "setNodeFilter" method to customize
its behavior.
includeTrunk ($boolean)
Based upon the value of $boolean, this will tell the visitor to include the trunk of the tree in the traversal as well.
setNodeFilter ($filter_function)
This method accepts a CODE reference as its $filter_function argument and throws an exception if it is not a code reference. This code
reference is used to filter the tree nodes as they are collected. This can be used to customize output, or to gather specific
information from a more complex tree node. The filter function should accept a single argument, which is the current Tree::Simple
object.
visit ($tree)
This is the method that is used by Tree::Simple's "accept" method. It can also be used on its own, it requires the $tree argument to be
a Tree::Simple object (or derived from a Tree::Simple object), and will throw and exception otherwise.
getResults
This method returns the accumulated results of the application of the node filter to the tree.
BUGS
None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
CODE COVERAGE
See the CODE COVERAGE section in Tree::Simple::VisitorFactory for more inforamtion.
SEE ALSO
These Visitor classes are all subclasses of Tree::Simple::Visitor, which can be found in the Tree::Simple module, you should refer to that
module for more information.
AUTHOR
stevan little, <stevan@iinteractive.com>
COPYRIGHT AND LICENSE
Copyright 2004, 2005 by Infinity Interactive, Inc.
<http://www.iinteractive.com>
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
perl v5.10.1 2005-07-14 Tree::Simple::Visitor::BreadthFirstTraversal(3pm)