graph-tool November 2010

graph-tool@skewed.de

3 participants
4 discussions

Segmentation fault using shortest_distance
by Juan Manuel Tirado 20 Mar '16

20 Mar '16

Hi Tiago, I am trying to calculate the shortest distances of a graph after applying a filter. I have a code that looks like this: g=gt.load_graph("myGraph.xml",format="xml") #for later use distances = gt.shortest_distance(g) #extract the components of the graph comp = g.label_components(g) #This splits the graph in several components #I want to calculate the shortest distances #for the component 2 for example filtering = g.new_vertex_property("boolean") for v in g.vertices(): if comp[v]==2: filtering[v]=True else: filtering[v]=False #set the vertex filter g.set_vertex_filter(filtering) distances_comp=gt.shortest_distance(g) The last line of code rises a segmentation fault. I have plotted the graph with the filtered graph and its correct, also I can calculate the local_clustering_coefficient without problems. Am I doing something wrong? Is there any other way to filter the graph and calculate the shortest distances? Is this a bug? Thanks so much, Juan

5 9

basic subroutines: dfs, dijstra, etc
by Rafael M. Frongillo 05 Dec '10

05 Dec '10

Hi all, I'm hoping to use graph-tool for a project involving huge graphs, but I can't seem to find simple routines like depth-first search and Dijkstra's algorithm in the documentation. I noticed that these are listed under milestone 2.2 -- are they not yet implemented? Apologies if the answer lies in the documentation or this mailing list; I have searched in vain for some time. I'd hate to turn to a much slower library for want of these simple routines... graph-tool looks perfect otherwise! Rafael

2 3

Property Maps
by Derek Ditch 30 Nov '10

30 Nov '10

Guten Tag! I read in another thread about how someone wanted to do reverse lookup in property maps. My project is similar, and I'm looking to use the vertex/edge filters for achieving this. I don't quite understand exactly the best way to use them though. Let's say I have a vertex property called 'color'. I have red, green, and blue vertices. If I want to mask the graph so as to only consider red vertices, colors = g.vertex_properties['color'].get_array() filter = numpy.ndarray( colors.size, dtype=bool ) filter = [ x == "red" for x in colors ] g.set_vertex_filter( filter ) Is this correct and the most efficient way to do this? I'm actually working on a very large dataset with comparisons that aren't as trivial. And just for clarification, does this mask out edges attached to green and blue vertices so that algorithms won't even see that they exist? For instance, pagerank won't consider these edges when performing the random walk. Also, let's say that I apply an edge filter instead, the resulting graph will still contain all the vertices, even if they're not connected to anything. Thanks, -- Derek

2 1

domain change for graph-tool website
by Tiago de Paula Peixoto 12 Nov '10

12 Nov '10

Hi, Due to a major SNAFU the domain forked.de is in the limbo now, and I'm currently unable to use it. Because of this the graph-tool website has been moved to the address: http://graph-tool.skewed.de along with this mailing list. Please update your bookmarks and tell your friends. Chers, Tiago -- Tiago de Paula Peixoto <tiago(a)skewed.de>

1 0

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

graph-tool November 2010