## [C] deleting node from graph

[C] deleting node from graph
# 1
06-17-2011
[C] deleting node from graph

Using adjacency lists, I implemented this operation as follows:

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

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

 Luke Bonham View Public Profile for Luke Bonham Find all posts by Luke Bonham
# 2
06-17-2011
I need to see your data structures too.
 Corona688 View Public Profile for Corona688 Visit Corona688's homepage! Find all posts by Corona688
# 3
06-18-2011
Oh, you're right.

Very essential.
 Luke Bonham View Public Profile for Luke Bonham Find all posts by Luke Bonham
# 4
06-18-2011
Hi Luke,

Quote:
Fact is, sometimes it crashes: could you help me understand why?
I didn't spend much time with your program, but it occured to me that these lines look rather suspicious:
Are you not supposed to free G->adj[u] first, and then perform the shifting G->adj[i-1] = G->adj[i] for i=u+1 to G->nv ?

Quote:
And is this a good implementation, or could I do better?
Is your graph directed, or undirected? What are the operations on the graph you want to be most efficient?

Cheers, Loïc
This User Gave Thanks to Loic Domaigne For This Post:
 Loic Domaigne View Public Profile for Loic Domaigne Find all posts by Loic Domaigne
# 5
06-18-2011

Quote:
Originally Posted by Loic Domaigne
I didn't spend much time with your program, but it occured to me that these lines look rather suspicious:
Are you not supposed to free G->adj[u] first, and then perform the shifting G->adj[i-1] = G->adj[i] for i=u+1 to G->nv ?
So I suppose doing it the opposite way is not correct, but why?

My graph is undirected and this is the operation I'd like to be the most efficient.
 Luke Bonham View Public Profile for Luke Bonham Find all posts by Luke Bonham
# 6
06-19-2011
Quote:
So I suppose doing it the opposite way is not correct, but why?
Because:
• If you would free G->adj[u], the pointer wouldn't be correct since you have already shifted.
You could perhaps get your code working by saving G->adj[u] before the shift; and then deleting it.

As your graph is undirected, there is many possible improvements. I'll try to post a few ideas tomorrow. But for now, it's bed time

Cheers, Loïc

---------- Post updated 06-19-11 at 06:15 AM ---------- Previous update was 06-18-11 at 10:31 PM ----------

Hi Luke,

here a few idea to improve the algorithm performance, given your data structure and the fact that the graph is undirected:
• instead of visiting of node of the graph to check if it has an edge to the node to delete, it is more efficient to only visit the nodes given in the adjacency list of node u.
• you don't need recursive function to remove the edge (u,v). Instead:
• you could perhaps try memmove() to shift the G->adj array. This should be equivalent to your shift operation, but eventually memmove() implementation is faster, because the libc designers usually take advantage of the underlying hardware (e.g. SSE instructions).
I don't know however if your data structure is the most suited for what you're targeting, but perhaps can Mrs. Google help you further...

HTH, Loïc
 Loic Domaigne View Public Profile for Loic Domaigne Find all posts by Loic Domaigne

## 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...

## 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...

## 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...

## 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.

## 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...

## 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...

## 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...

## 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 ...

## Graph generation

How can I generate graphs using perl in unix solaris environment? Please suggest.