June 2015 - graph-tool - archives.skewed.de

How to control the orientation of the graph topology
by Xun Xiao 26 Feb '22

26 Feb '22

Hi Tiago, sometimes, when delete the graph and create a new one, then plot it, the plotted graph is shown upside down (in terms of the node text). So how could we control the orientation of the graph? Or which parameter we should use to always make node text shown in a correct orientation. Thanks a lot. -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com… Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

3 5

Upside down labels
by charlie 26 Feb '22

26 Feb '22

Hi, I'm suffering from the same issue mentioned in this post: https://git.skewed.de/count0/graph-tool/issues/174 Namely, I'm trying to draw a graph that includes a lot of self-looping edges, and my labels are being printed upside down. If I remove the self-loops the labels are shown the right way up. Is there a fix for it? Thanks, Charlie -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com… Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

3 3

What formula is used for std in vertex_average and edge_average?
by VaSa 16 Jul '20

16 Jul '20

I am curious what is being used to calculate the standard deviation of the average in gt.vertex_average and gt.edge_average >>> t2=gt.Graph() >>> t2.add_vertex(2) >>> t2.add_edge(t2.vertex(0), t2.vertex(1)) >>> gt.vertex_average(t2, "in") (0.5, 0.35355339059327373) Now, shouldn't std be σ(n)=sqrt(((0-0.5)^2+(1-0.5)^2)/2)=0.5 ? also q(n-1)=sqrt((0.5^2+0.5^2)/(2-1))~=0.70710 0.3535 is sqrt(2)/4 which happens to be σ(n-1)/2, so it seems there is some relation to that. A little bigger graph. >>> t3=gt.Graph() >>> t3.add_vertex(5) >>> t3.add_edge(t3.vertex(0), t3.vertex(1)) >>> gt.vertex_average(t3, "in") (0.2, 0.17888543819998318) Now, we should have 0,1,0,0,0 series for vertex incoming degree. So Windows calc gives σ(n)=0.4 and σ(n-1)~=0.44721, so where does 0.1788854 come from ? Reason, I am asking because, I have a large graph, where the average looks quite alright but the std makes no sense, as going by the histogram, degree values are quite a bit more distributed than the std would indicate. -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com… Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

3 3

apt-get fail to download index files
by Andy Maloney 10 Mar '17

10 Mar '17

I am trying to install graph-tool on a Trusty Ubuntu virtualbox being hosted on a Mac. I've added the requisite lines deb http://downloads.skewed.de/apt/trusty trusty main deb-src http://downloads.skewed.de/apt/trusty trusty main to my /etc/apt/sources.list, but when I run a sudo apt-get update, I get the following errors: W: Failed to fetch http://downloads.skewed.de/apt/trusty/dists/trusty/Release Unable to find expected entry 'main/source/Sources' in Release file (Wrong sources.list entry or malformed file) E: Some index files failed to download. They have been ignored, or old ones used instead. I have the main, universe, and multiverse repositories available. If any one has come across this problem before, please let me know how to fix it. Thanks. Andy_

4 4

Building graph-tool on CentOS 7
by Smith, Steven - 1004 - MITLL 28 Oct '16

28 Oct '16

The graph-tool make command on CentOS 7 fails at this point: $ cd graph-tool-2.2.35 $ ./configure --with-sparsehash-prefix=google $ make make all-recursive make[1]: Entering directory `/home/user/Downloads/graph-tool-2.2.35' Making all in src … make[4]: Entering directory `/home/user/Downloads/graph-tool-2.2.35/src/graph/topology' CXX graph_subgraph_isomorphism.lo graph_subgraph_isomorphism.cc: In instantiation of 'void get_subgraphs::operator()(const Graph1&, const Graph2*, VertexLabel, boost::any, EdgeLabel, boost::any, std::vector<VertexMap>&, size_t, bool, bool) const [with Graph1 = boost::adj_list<long unsigned int>; Graph2 = boost::adj_list<long unsigned int>; VertexLabel = boost::unchecked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >; EdgeLabel = boost::unchecked_vector_property_map<int, boost::adj_edge_index_property_map<long unsigned int> >; VertexMap = boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >; size_t = long unsigned int]': /usr/include/c++/4.8.2/functional:1305:50: required from '_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::adj_list<long unsigned int>&, boost::adj_list<long unsigned int>*&, boost::unchecked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >&, boost::unchecked_vector_property_map<int, boost::adj_edge_index_property_map<long unsigned int> >&}; long unsigned int ..._Indexes = {0ul, 1ul, 2ul, 3ul, 4ul, 5ul, 6ul, 7ul, 8ul, 9ul}; _Functor = get_subgraphs; _Bound_args = {std::_Placeholder<1>, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, std::_Placeholder<4>, boost::any, std::reference_wrapper<std::vector<boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >, std::allocator<boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> > > > >, long unsigned int, bool, bool}]’ … _descriptor>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_:: na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_:: na, mpl_::na, mpl_::na, mpl_::na>}]' graph_subgraph_isomorphism.cc:178:56: required from here graph_subgraph_isomorphism.cc:108:114: error: 'vf2_subgraph_mono' was not declared in this scope vertices_equivalent(make_property_map_equivalent(vertex_label1, vertex_label2))); ^ … , graph_tool::ConstantPropertyMap<bool, boost::adj_list<long unsigned int>::edge_descriptor>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>}]' graph_subgraph_isomorphism.cc:178:56: required from here graph_subgraph_isomorphism.cc:108:114: error: 'vf2_subgraph_mono' was not declared in this scope Any help fixing this would be greatly appreciated. I’m building graph-tool from the latest source, graph-tool-2.2.35.tar.bz2. CGAL is built successfully from source (there aren’t any cgal-devel packages yet in the .el7 repos), and because the .el 7 sparsehash-devel package puts its libraries in /usr/include/google, the specific ./configure command for CentOS 7 above is necessary. This runs successfully, and every compile up to graph_subgraph_isomorphism is successful.

3 13

Shortest_distance complexity when used with max_dist
by François 05 Sep '16

05 Sep '16

<disclaimer> I hope this question isn't too dumb, if it is please accept my apologies. </disclaimer> Hi list, The graph that I work with has ≈ 30M vertices and ≈ 60M edges. This graph has positive weights, it represents a Road network. I need to compute the shortest path form a node to any other node within a range. The documentation shortest_distance <http://graph-tool.skewed.de/static/doc/topology.html#graph_tool.topology.sh…> , states that the complexity (source and weights specified) is O(VlogV). My question is: "What happens when the *max_dist* parameter is specified ?" I observed that the execution time of *shortest_distance* increases linearly with the number of vertices. The execution time goes from 19ms with a sub-sample of 1M vertices and 2M edges to 320ms with the full graph. How can it be explained ? Thanks for your help, François. -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com… Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

2 17

find community classes/labels
by yinjunjun 04 Jul '16

04 Jul '16

Hi, I am trying to use graph tool to extract communities, and I used the minimize_blockmodel_dl function. However, after it has been executed successfully, I wish to know each vertex and information of which community it belongs to, and I can not figure out how. For example, state = graph_tool.community.minimize_blockmodel_dl(g, parallel=True) ##print state.b print state.get_blocks().get_array() it give me an array of all the vertex in zero. Could any one point me to the right directions. Thank you very much. Best Regards Junjun -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com… Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

3 5

graph-tool can't find Graphviz renderer
by Mikhail Spivakov 07 Apr '16

07 Apr '16

Hello! I've got graphviz installed with python and python27 bindings. However, when I do: graph_draw(ug, vprops={"label": ug.vertex_index}, output="two-nodes.pdf", layout="fdp") I get the following error: graph G { graph [outputorder=edgesfirst, mode=major, overlap=true, ratio=fill, size="5.905512,5.905512", start=3019255687130444316]; node [label="\N", shape=circle, width="0.105", height="0.105", style=filled, color="#2e3436", fillcolor="#a40000"]; edge [arrowsize="0.3", color="#2e3436", penwidth="1.0"]; graph [bb="0,0,425,425"]; 0 [label=0, width="0.47", height="0.47", pos="330,101"]; 1 [label=1, width="0.47", height="0.47", pos="93,324"]; 0 -- 1 [pos="318,113 277,152 147,274 106,312"]; } Error: renderer for pdf is unavailable Out[8]: <PropertyMap object with key type 'Vertex' and value type 'vector<double>', for Graph 0x5ff3f90, at 0x6001290> At the same time, if I save the above dot expression as test1.dot and run the following command from the command line: $ dot -Tpng test1.dot -o graph1.png I get a beautiful graph1.png. Graphviz is installed in a non-standard location as I don't have admin rights. However, the graphviz folder is in LD_LIBRARY_PATH and gv.py is in PYTHONPATH. Would very much appreciate your advice on what else graph-tool might need to find the libraries and/or how to test it better. Many thanks, Mikhail

3 5

Simple Cycle Finder
by tanzairatier 25 Mar '16

25 Mar '16

Hello all, I'm wondering if anyone can suggest a strategy for finding elementary cycles with Graph-Tool. I'm working also with Network X, and they have a function for this, called simple_cycles(G). That function essentially runs Tarjan's Algorithm to find all strongly connected components, and then detects cycles within each of those components (this approach is called Johnson's Algorithm). I've tried to port the Network X code to Graph-Tool, but there are un-matching parallels in the data structures of both tools. e.g. Graph-Tool prefers to label with property maps. Since I've only begun using Graph-Tool a short while ago, this task is difficult for me. Any help would be appreciated, many thanks in advance. -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com… Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

3 2

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