Sponsored Content
Full Discussion: [C] deleting node from graph
Top Forums Programming [C] deleting node from graph Post 302531699 by Luke Bonham on Friday 17th of June 2011 01:52:23 PM
Old 06-17-2011
[C] deleting node from graph

Using adjacency lists, I implemented this operation as follows:

Code:
/* remove the first node it finds with value 'val' in L list */
edge *removeEdge (edge *L, int val)
{
      if( !L ) return NULL;

      if( L->key == val )
      {
          edge *temp = L->next;
          free (L);
          return temp;
      }

      L->next = removeEdge (L->next, val);

      return L;
}

/* deletes node with key u from G */
int g_deleteNode (graph *G, int u)
{
    int i;     
    
    if( G != NULL && (u >= 0 && u < G->nv) )
    {   
        for( i = 0; i < G->nv; i++ )
             /* because removeEdge is a list node removing function */
             G->adj[i]->next = removeEdge (G->adj[i]->next, u);
        
        for( i = u; i < G->nv; i++ )
             if( i + 1 < G->nv ) G->adj[i] = G->adj[i+1];
        
        free(G->adj[i]);
        
        G->nv--;
               
        return 1;
    }
    
    else
    {
        if( !G ) printf("Error: null graph.\n");
        else printf("Error: edge does not belong to graph.\n");        
        return 0;
    }
}

Fact is, sometimes it crashes: could you help me understand why?

And is this a good implementation, or could I do better?

Thanks in advance.
 

9 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Graph generation

How can I generate graphs using perl in unix solaris environment? Please suggest. (2 Replies)
Discussion started by: wadhwa.pooja
2 Replies

2. AIX

Performance graph

Guru's I need to develop a graph which shows the CPU, memory and swap space utilization in a single graph against time I know of NMON but I am not able to make a single graph out of it. Does anyone know of any script or tool for data sampling and developing graph? Thanks in advance ... (1 Reply)
Discussion started by: balaji_prk
1 Replies

3. Shell Programming and Scripting

FS Growth Graph

It's been a while since i've been here.. and hopefully you can help me. I have created a script to get the filesystem utilization. Now i want to create a growth graph, which would show how much kb we increase per day. Here's the data 03-02-2010 00:00:00: /dev/md/dsk/d30 46473377 7355320... (5 Replies)
Discussion started by: ryandegreat25
5 Replies

4. Solaris

SVM metaset on 2 node Solaris cluster storage replicated to non-clustered Solaris node

Hi, Is it possible to have a Solaris cluster of 2 nodes at SITE-A using SVM and creating metaset using say 2 LUNs (on SAN). Then replicating these 2 LUNs to remote site SITE-B via storage based replication and then using these LUNs by importing them as a metaset on a server at SITE-B which is... (0 Replies)
Discussion started by: dn2011
0 Replies

5. UNIX for Dummies Questions & Answers

Help with Plotting a graph using Perl

Dear all, I have a hash in my data file and I'd like to output the data contained within as a graph (can be lines or histogram form) but I dont know how to do this with Perl. Can somone suggest how I can have a graph with Keys of the hash being on the X-axis and the Values for the keys plotted on... (1 Reply)
Discussion started by: pawannoel
1 Replies

6. Programming

Graph in java

Hello, Please how can represent this graph in java ? i have to apply an algorithm on this graphe, the first instruction of the algorithm is to verify if the three last vertices are dependent or not ? Thank you. (1 Reply)
Discussion started by: chercheur857
1 Replies

7. UNIX for Dummies Questions & Answers

Deleting a pattern in UNIX without deleting the entire line

Hi I have a file: r58778.3|SOURCES={KEY=f665931a...,fw,221-705}|ERRORS={16_1:T,30_1:T,56_1:C,57_1:T,59_1:A,101_1:A,115:-,158_1:C,186_1:A,204:-,271_1:T,305:-,350_1:C,368_1:G,442_1:C,472_1:G,477_1:A}|SOURCE_1="Contig_1092402550638"(f665931a359e36cea0976db191ff60ff09cc816e) I want to retain... (15 Replies)
Discussion started by: Alyaa
15 Replies

8. Homework & Coursework Questions

Accessing one UNIX node from another node of the same server

Hi Experts, I am in need of running a script from one node say node 1 via node 2. My scheduling tool dont have access to node2 , so i need to invoke the list file from node1 but the script needs to run from node2. because the server to which i am hitting, is having access only for the node... (5 Replies)
Discussion started by: arun1377
5 Replies

9. HP-UX

Mount FIle systems from node-1 onto node-2

Hi, We have HP UX service guard cluster on OS 11.23. Recently 40+ LUNs presented to both nodes by SAN team but I was asked to mount them on only one node. I created required VGs/LVs, created VxFS and mounted all of them and they are working fine. Now client requested those FS on 2nd node as... (4 Replies)
Discussion started by: prvnrk
4 Replies
TSORT(1)						    BSD General Commands Manual 						  TSORT(1)

NAME
tsort -- topological sort of a directed graph SYNOPSIS
tsort [-l] [-q] [file] DESCRIPTION
tsort takes a list of pairs of node names representing directed arcs in a graph and prints the nodes in topological order on standard output. Input is taken from the named file, or from standard input if no file is given. Node names in the input are separated by white space and there must be an even number of node names. Presence of a node in a graph can be represented by an arc from the node to itself. This is useful when a node is not connected to any other nodes. If the graph contains a cycle (and therefore cannot be properly sorted), one of the arcs in the cycle is ignored and the sort continues. Cycles are reported on standard error. The options are as follows: -l Search for and display the longest cycle. Can take a very long time. -q Do not display informational messages about cycles. This is primarily intended for building libraries, where optimal ordering is not critical, and cycles occur often. SEE ALSO
ar(1) HISTORY
A tsort command appeared in Version 7 AT&T UNIX. This tsort command and manual page are derived from sources contributed to Berkeley by Michael Rendell of Memorial University of Newfoundland. BSD
April 1, 1994 BSD
All times are GMT -4. The time now is 01:33 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy