10-30-2009
does not make effect. should generate many vertices for a graph. but it will fail after 20 vertices.
can generate 20 vertices. after then, it fails. can't figure out.
10 More Discussions You Might Find Interesting
1. Programming
when i try to use the class i wrote, i either get this:
*** glibc detected *** double free or corruption: 0x40236ff4 ***
and the proccess exits with an error code of 0;
or it segfaults. could someone look at my header file (with imp.) to give me some insight as to why its not working?
... (19 Replies)
Discussion started by: norsk hedensk
19 Replies
2. Programming
I am using a structure defined as follows
struct gene_square
{
double *x;
double *y;
};I have class, with a member function which is a pointer of this type:
gene_square* m_Genes;I am allocating memory in the constructors like this:
m_Genes = new gene_square;
for (ii=0;... (1 Reply)
Discussion started by: jatoo
1 Replies
3. Programming
Hi,
I am having a hell of a time getting this to work. So basically, I have opened a popen to run a program that is going to prompt an action to occur half way through, when it gets to this I need to create a separate process and do some stuff, then return to the original process. This works... (0 Replies)
Discussion started by: imrank27
0 Replies
4. Programming
Hi All,
I have a simple code which does some computation by matching string patterns.
In brief:
1. The code reads .dat and .txt files.
2. .dat files are huge text files and .txt files contain some important words.
3. I am just doing strstr to find the patterns.
4. The function returns the... (3 Replies)
Discussion started by: shoaibjameel123
3 Replies
5. Programming
*** glibc detected *** ./a.out: malloc(): memory corruption (fast):
Posted A minute ago
M trying to make multiway tree and dont know what happend when this part of code get executed:
01void ins(NODE *ptr)
02{
03 //working
04 if(ptr!=NULL)
05 {
06 SNODE *var=NULL;
07 var=(SNODE... (3 Replies)
Discussion started by: exgenome
3 Replies
6. Programming
I am using libxml2 library for XMl parsing and libxml++ is C++ wrapper over that. So I am using API of libxml++. I am creating my class and composing instance xmlpp::Node *pNode in that. my class also have funciton prepareXPathQuery() which creates query string and have other fucntion... (2 Replies)
Discussion started by: sharadwagh
2 Replies
7. Programming
Hi Friends,
while executing the below code, am getting *** glibc detected *** ./ok: malloc(): memory corruption (fast) error, please suggest how to solve this issue.
#include <stdio.h>
#include <string.h>
#include <sqlca.h>
#include <alloca.h>
/* Define constants for VARCHAR... (2 Replies)
Discussion started by: mpjobsrch
2 Replies
8. Programming
I am facing a problem of memory corruption. The loop runs for the first time but does not go through the second time. What could be the problem?
for(int z=0;z<2;z++)
{
fp=fopen("poly.dat","r");
/*do something which reads this file into a 2D array*/
fclose(fp);
... (10 Replies)
Discussion started by: dare
10 Replies
9. Programming
Currently I test a shared library vendor provided in linux , the following is the simple source :
#include <iostream>
using namespace std;
extern int test1();
extern int test2();
int main()
{
cout << "hello world" << endl ;
return 0 ;
cout << "Test 1" << endl;
... (6 Replies)
Discussion started by: barfatchen
6 Replies
10. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
I'm doing aproximation of derivative called five-point stencil. For every value of x, in interval , in step... (0 Replies)
Discussion started by: antonija
0 Replies
GC(1) General Commands Manual GC(1)
NAME
gvgen - generate graphs
SYNOPSIS
gvgen [ -d? ] [ -cn ] [ -Cx,y ] [ -g[f]x,y ] [ -G[f]x,y ] [ -hn ] [ -kn ] [ -bx,y ] [ -pn ] [ -sn ] [ -Sn ] [ -tn ] [ -Tx,y ] [ -wn ] [
-ooutfile ]
DESCRIPTION
gvgen generates a variety of simple, regularly-structured abstract graphs.
OPTIONS
The following options are supported:
-c n Generate a cycle with n vertices and edges.
-C x,y Generate an x by y cylinder. This will have x*y vertices and 2*x*y - y edges.
-g [f]x,y
Generate an x by y grid. If f is given, the grid is folded, with an edge attaching each pair of opposing corner vertices. This
will have x*y vertices and 2*x*y - y - x edges if unfolded and 2*x*y - y - x + 2 edges if folded.
-G [f]x,y
Generate an x by y partial grid. If f is given, the grid is folded, with an edge attaching each pair of opposing corner vertices.
This will have x*y vertices.
-h n Generate a hypercube of degree n. This will have 2^n vertices and n*2^(n-1) edges.
-k n Generate a complete graph on n vertices with n*(n-1)/2 edges.
-b x,y Generate a complete x by y bipartite graph. This will have x+y vertices and x*y edges.
-p n Generate a path on n vertices. This will have n-1 edges.
-s n Generate a star on n vertices. This will have n-1 edges.
-S n Generate a Sierpinski graph of order n. This will have 3*(3^(n-1) - 1)/2 vertices and 3^n edges.
-t n Generate a binary tree of height n. This will have 2^n-1 vertices and 2^n-2 edges.
-T x,y Generate an x by y torus. This will have x*y vertices and 2*x*y edges.
-w n Generate a path on n vertices. This will have n-1 edges.
-o outfile
If specified, the generated graph is written into the file outfile. Otherwise, the graph is written to standard out.
-d Make the generated graph directed.
-? Print usage information.
EXIT STATUS
gvgen exits with 0 on successful completion, and exits with 1 if given an ill-formed or incorrect flag, or if the specified output file
could not be opened.
AUTHOR
Emden R. Gansner <erg@research.att.com>
SEE ALSO
gc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)
27 March 2008 GC(1)