gmane.comp.science.graph.graph-tool.bugs
http://blog.gmane.org/gmane.comp.science.graph.graph-tool.bugs
hourly11901-01-01T00:00+00:00Gmanehttp://gmane.org/img/gmane-25t.png
http://gmane.org
[graph-tool-tickets] Ticket #104: No setup.py makesinstallation with pip impossible
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/695
<pre>#104: No setup.py makes installation with pip impossible
new defect
---------------------------------------------------------------------
Reporter: jeffrey.finkelstein< at >gmail.com
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
Without a `setup.py` file, `graph-tool` cannot be installed using `pip`. This is a pain if one wants to distribute a Python package which depends on it.
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/104>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-05-23T20:18:14[graph-tool-tickets] Ticket #103: Compilation onArchlinux fails
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/686
<pre>#103: Compilation on Archlinux fails
new defect
---------------------------------------------------------------------
Reporter: muellner< at >math.stanfod.edu
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
Compilation on Archlinux fails. I have Python 2 and Python 3 installed on my system. To make the configure script work, I set the environment variable PYTHON_VERSION=2.7. I attach config.log and the output of make, in the hope that the source of the error can be determined by that.
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/103>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-05-12T17:15:11[graph-tool-tickets] Ticket #102: ImportError: Nomodule named graph_tool.all
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/681
<pre>#102: ImportError: No module named graph_tool.all
new defect
---------------------------------------------------------------------
Reporter: subusurendran< at >gmail.com
Owner: tiago peixoto
Priority: major
Milestone: 3.0
---------------------------------------------------------------------
Hai,
I am new in using graph-tool module. After the installation i tried to execute the python statement "import graph_tool.all as gt" to check the installation. But I am getting an error message"ImportError: No module named graph_tool.all".
Environment:
UBUNTU 11.04
Python 2.7.1
[GCC 4.5.2]
Can anyone help me to rectify the problem
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/102>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-05-09T13:50:24[graph-tool-tickets] Ticket #101: Git Build fails onMac OS X Lion
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/677
<pre>#101: Git Build fails on Mac OS X Lion
new defect
---------------------------------------------------------------------
Reporter: oscarvarto< at >gmail.com
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
My ./configure output is here:
http://pastebin.com/ZsKdTBrP
I installed boost with macports:
`sudo port install boost +python27`
(boost 1.49)
Don't know how to fix this...
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/101>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-05-08T16:49:50[graph-tool-tickets] Ticket #100: graph-tool cannot find gvc library when it's installed in a non-standard location
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/668
<pre>#100: graph-tool cannot find gvc library when it's installed in a non-standard location
new defect
---------------------------------------------------------------------
Reporter: spivakov< at >ebi.ac.uk
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
The problem occurred when another, older version of gvc was found in a standard location, while the version I was looking for was installed into a custom folder, specified in LD_LIBRARY_PATH.
My solution to this, which unfortunately isn't elegant, was to hardcode the library name into draw/ init .py instead of using
ctypes.util.find_library. The problem with find_library is that it doesn't consult
LD_LIBRARY_PATH, making the search algorithm rather inflexible.
libgv = ctypes.CDLL("libgvc.so.6.0.0")
# libname = ctypes.util.find_library("gvc")
# if libname is None:
# raise OSError()
# libgv = ctypes.CDLL(libname)
Hopefully, something more robust can be done about this.
Thanks!
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/100>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-04-09T21:45:27[graph-tool-tickets] Ticket #99: graph-tool does notcompile with boost 1.49.0
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/660
<pre>#99: graph-tool does not compile with boost 1.49.0
new defect
---------------------------------------------------------------------
Reporter: Mikhail Spivakov
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
CXX graph_betweenness.lo
...
boost/property_map/property_map.hpp:354: error: no match for
'operator[]' in '(const boost::unchecked_vector_property_map<long
double, boost::adj_list_edge_property_map<boost::bidirectional_tag,
long unsigned int, long unsigned int&, long unsigned int,
boost::property<boost::edge_index_t, long unsigned int,
boost::no_property>, boost::edge_index_t> >&)((const
boost::unchecked_vector_property_map<long double,
boost::adj_list_edge_property_map<boost::bidirectional_tag, long
unsigned int, long unsigned int&, long unsigned int,
boost::property<boost::edge_index_t, long unsigned int,
boost::no_property>, boost::edge_index_t> >*)(& pa))[k]'
...
/homes/spivakov/n/boost_1_49_0/boost/property_map/property_map.hpp:361:
error: no match for 'operator[]' in '(const
boost::unchecked_vector_property_map<double,
boost::adj_list_edge_property_map<boost::bidirectional_tag, long
unsigned int, long unsigned int&, long unsigned int,
boost::property<boost::edge_index_t, long unsigned int,
boost::no_property>, boost::edge_index_t> >&)((const
boost::unchecked_vector_property_map<double,
boost::adj_list_edge_property_map<boost::bidirectional_tag, long
unsigned int, long unsigned int&, long unsigned int,
boost::property<boost::edge_index_t, long unsigned int,
boost::no_property>, boost::edge_index_t> >*)(& pa))[k]'
OS: CentOS 5.4
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/99>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-04-05T18:25:26[graph-tool-tickets] Ticket #98: PropertyMaps 'reuse' values assigned to deleted vertices/edges
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/655
<pre>#98: PropertyMaps 'reuse' values assigned to deleted vertices/edges
new defect
---------------------------------------------------------------------
Reporter: Wojciech Waśko <wojciechwasko< at >gmail.com>
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
While I was unit-testing my code, I came across some strange behaviour, which I traced back to `graph-tool`.
If I have some property maps and delete vertices/edges from the corresponding graph and then add some other vertex/edge, the property map 'reuses' the previously assigned values, corresponding to already-deleted vertices/edges.
It is best illustrated by the following:
{{{#!python>>> import graph_tool as gt
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/usr/lib/python2.7/site-packages/graph_tool/__init__.py", line 403, in __getitem__
return self.__map[self.__key_trans(k)]
ValueError: invalid edge descriptor
'eprop'
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/usr/lib/python2.7/site-packages/graph_tool/__init__.py", line 403, in __getitem__
return self.__map[self.__key_trans(k)]
ValueError: invalid vertex descriptor: 0
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/usr/lib/python2.7/site-packages/graph_tool/__init__.py", line 403, in __getitem__
return self.__map[self.__key_trans(k)]
ValueError: invalid vertex descriptor: 0
'vprop'
}}}
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/98>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-03-28T10:06:30[graph-tool-tickets] Ticket #97: Deleting edges isbroken
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/651
<pre>#97: Deleting edges is broken
new defect
---------------------------------------------------------------------
Reporter: Wojciech Waśko <wojciechwasko< at >gmail.com>
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
[3a528888d] broke removing edges; the problem is at line 1043 of file `./graph_tool/__init__.py`
Is:
{{{
return libcore.remove_edge(self, edge)
}}}
Should be:
{{{
return libcore.remove_edge(self.__graph, edge)
}}}
The [3a528888d] version would produce the following error:
{{{#!python
<Edge object with source '0' and target '0' at 0x16d8dd0>
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/usr/lib/python2.7/site-packages/graph_tool/__init__.py", line 1043, in remove_edge
return libcore.remove_edge(self, edge)
Boost.Python.ArgumentError: Python argument types in
graph_tool.libgraph_tool_core.remove_edge(Graph, Edge)
did not match C++ signature:
remove_edge(graph_tool::GraphInterface {lvalue}, boost::python::api::object)
}}}
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/97>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-03-21T12:01:08[graph-tool-tickets] Ticket #96: Compilation Fail OnArch Linux
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/641
<pre>#96: Compilation Fail On Arch Linux
new defect
---------------------------------------------------------------------
Reporter: lee.mcculler< at >gmail.com
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
I'm trying to compile graph_tool on arch using GCC 4.6.3 and boost 1.49.0 against the current git master and I get the following compilation error. I don't know how to parse all of the verbose template output so I'm just putting all of it (attached)
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/96>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-03-20T18:45:15[graph-tool-tickets] Ticket #95: Edges are reported not to be instances of graph-tool's Edge class
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/635
<pre>#95: Edges are reported not to be instances of graph-tool's Edge class
new defect
---------------------------------------------------------------------
Reporter: Wojciech Waśko <wojciechwasko< at >gmail.com>
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
Today, I came across the following bug: edges returned from `graph_tool.Graph.add_edge()` or `graph_tool.Graph.edge()` fail test for `isintance` against graph-tool's `Edge`. See the snippet below:
{{{#!python
<class 'graph_tool.libgraph_tool_core.Vertex'>
<class 'graph_tool.libgraph_tool_core.Vertex'>
<class 'graph_tool.libgraph_tool_core.Edge'>
<class 'graph_tool.libgraph_tool_core.Edge'>
True
True
False
False
False
False
}}}
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/95>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-03-09T13:33:10[graph-tool-tickets] Ticket #94: Access underlyinggraph from Vertex or Edge
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/634
<pre>#94: Access underlying graph from Vertex or Edge
new enhancement
---------------------------------------------------------------------
Reporter: Wojciech Waśko <wojciechwasko< at >gmail.com>
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
It would be nice if one could access the underlying graph from `Vertex`/`Edge` context.
The primary motivation is that in order to set a property of a vertex/edge, you need to do it through `Graph.vertex_properties`/`Graph.edge_properties`, thus needing the `Graph` object itself.
I don't know the implementation details of `graph-tool`, but I can see that internally, there is some kind of access to the underlying graph from `Vertex`/`Edge` context:
{{{#!python
True
True
False
False
}}}
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/94>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-03-09T09:35:49[graph-tool-tickets] Ticket #93: Problem Installinggraph tool on Macosx
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/632
<pre>#93: Problem Installing graph tool on Macosx
new defect
---------------------------------------------------------------------
Reporter: halehashki< at >gmail.com
Owner: tiago peixoto
Priority: major
Milestone: (None)
---------------------------------------------------------------------
Dear Sir/Mam,
I did download MacPort .dmg file and installed it.looks work fine.but when I want to use it to install graph tool gives me this error:
port install py-graph-tool
Error: Insufficient privileges to write to MacPorts install prefix.
I will be thankful if you help me solve the problem.
Thanks,
Haleh
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/93>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-03-07T17:03:42[graph-tool-tickets] Ticket #92: Incorrect modularityevaluation
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/630
<pre>#92: Incorrect modularity evaluation
new defect
---------------------------------------------------------------------
Reporter: gamma2< at >users.sourceforge.net
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
The current implementation of the modularity mixes edge weights and unweighted degrees.
Given the modularity definition:
Q = 1/(2m) * sum_ij [ A(i,j) - k(i)*k(j)/(2m) ] d(c_i,c_j)
In the code, while A(i,j) uses the weights, k(i)*k(j) is calculated using just the degree of the vertices, instead of summing the weights of the edges.
The paper where Newman defined the weighted modularity is http://arxiv.org/pdf/condmat/0407503.pdf , page 7, formula 9. I know you refer to the 2006's paper, where only vertex degree is used, however the notation is the same.
You can easily check it by creating a graph with 2 vertices, connected by an edge with weight 0.1, and putting them in the same community. Using your modularity implementation, without passing the weights, you correctly get 0.0 as answer. If you call modularity and pass the weights, you get -9.0, which is way out of the [-0.5,1] range of the modularity definition.
A (rough) patch is attached. Its complexity is a bit higher than the previous version, O(V^2 ), but I'm working on an improvement.
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/92>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-02-28T10:30:47[graph-tool-tickets] Ticket #91: Installation onPythonXY
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/628
<pre>#91: Installation on PythonXY
new enhancement
---------------------------------------------------------------------
Reporter: jhinebau< at >mie.utoronto.ca
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
Is it possible to install this tool kit into a PythonXY framework?
A collaborative project is starting based in Python. Some of our team members cannot work from Linux machines due to security restrictions at their work-places. Are there instructions available for getting the Graph-Tool libraries installed on a Windows XP machine? That machine will preferably use PythonXY.
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/91>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-02-24T23:54:38[graph-tool-tickets] Ticket #89: Drawing verticeslabels does not work
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/622
<pre>#89: Drawing vertices labels does not work
new defect
---------------------------------------------------------------------
Reporter: wojciechwasko< at >gmail.com
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
I've been trying to add labels to nodes when drawing a graph. The documentation is not clear on that, however I guess it should be done through the `vpropos` attribute of the `graph_tool.draw.graph_draw` function.
This does not seem to work. Below, I attach the commands I used to create the plot, and the plot itself.
{{{
##### [12:54:17] # [dare2be< at >PC10CIS:~] #####
$ python
Python 2.7.2 (default, Oct 27 2011, 01:40:22)
[GCC 4.6.1 20111003 (Red Hat 4.6.1-10)] on linux2
Type "help", "copyright", "credits" or "license" for more information.
<PropertyMap object with key type 'Vertex' and value type 'vector<double>', for Graph 0x1e969d0, at 0x1e96a90>
}}}
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/89>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-02-21T13:49:28[graph-tool-tickets] Ticket #88: Tarball is missingstuff
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/620
<pre>#88: Tarball is missing stuff
new defect
---------------------------------------------------------------------
Reporter: dmitrijs ledkovs
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
Tarball release is missing following things:
* src/graph/topology/graph_reciprocity.cc
* doc/
first one doesn't seem to be used in the Makefile.am since beginning of time.... Maybe it's junk? Maybe it should be built?
Docs are missing as well.
probably `$ make dist` is playing up.
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/88>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-02-13T20:39:54[graph-tool-tickets] Ticket #87: Compilation problemwith Fedora 15 / gcc 4.6
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/615
<pre>#87: Compilation problem with Fedora 15 / gcc 4.6
new defect
---------------------------------------------------------------------
Reporter: andreas.putz< at >afcc-auto.com
Owner: tiago peixoto
Priority: normal
Milestone: 2.2
---------------------------------------------------------------------
I am trying to install graph-tool on my Fedora 15 notebook. The reported error showed up on a google search (http://answerpot.com/showthread.php?3073566-graphtool+compile+error+on+F15), but has not been brought to a conclusion. There is also an older thread in a related issue (http://groups.google.com/group/boost-list/browse_thread/thread/eca7c42f287f0f00)
I am compiling the code on a Fedora 14 machine at the moment, and that seems to work (The compilation is not done yet though).
The error described below manifests in the stable release as well as the trunk.
= System =
{{{
[root< at >hex graph-tool-trunk]# python -V
Python 2.7.1
[root< at >hex graph-tool-trunk]# gcc -v
Using built-in specs.
COLLECT_GCC=/usr/bin/gcc
COLLECT_LTO_WRAPPER=/usr/libexec/gcc/x86_64-redhat-linux/4.6.1/lto-wrapper
Target: x86_64-redhat-linux
Configured with: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --with-bugurl=http://bugzilla.redhat.com/bugzilla --enable-bootstrap --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-gnu-unique-object --enable-linker-build-id --enable-languages=c,c++,objc,obj-c++,java,fortran,ada,go,lto --enable-plugin --enable-java-awt=gtk --disable-dssi --with-java-home=/usr/lib/jvm/java-1.5.0-gcj-1.5.0.0/jre --enable-libgcj-multifile --enable-java-maintainer-mode --with-ecj-jar=/usr/share/java/eclipse-ecj.jar --disable-libjava-multilib --with-ppl --with-cloog --with-tune=generic --with-arch_32=i686 --build=x86_64-redhat-linux
Thread model: posix
gcc version 4.6.1 20110908 (Red Hat 4.6.1-9) (GCC)
}}}
== Libraries ==
* Boost 1.46.0
= Configuration =
./configure --with-numpy=/usr/lib64/python2.7/site-packages/numpy --with-scipy=/usr/lib64/python2.7/site-packages/scipy
Config.log attached to this ticket
= Build Step =
{{{
[root< at >hex graph-tool-trunk]# make
make all-recursive
make[1]: Entering directory `/global/Fedora/Scientific/graph-tool-trunk'
Making all in src
make[2]: Entering directory `/global/Fedora/Scientific/graph-tool-trunk/src'
Making all in graph
make[3]: Entering directory `/global/Fedora/Scientific/graph-tool-trunk/src/graph'
Making all in centrality
make[4]: Entering directory `/global/Fedora/Scientific/graph-tool-trunk/src/graph/centrality'
CXX graph_betweenness.lo
CXX graph_centrality_bind.lo
CXX graph_eigentrust.lo
CXX graph_eigenvector.lo
CXX graph_pagerank.lo
CXX graph_trust_transitivity.lo
In file included from ./../graph_filtering.hh:22:0,
from graph_trust_transitivity.cc:18:
/usr/include/boost/graph/graph_traits.hpp: In instantiation of 'boost::graph_property_type<const boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >&> >':
/usr/include/boost/graph/filtered_graph.hpp:240:55: instantiated from 'boost::graph_property_type<boost::filtered_graph<const boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >&>, boost::keep_all, graph_tool::filter_vertex_pred> >'
/usr/include/boost/graph/reverse_graph.hpp:94:59: instantiated from 'boost::reverse_graph<boost::filtered_graph<const boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >&>, boost::keep_all, graph_tool::filter_vertex_pred>, const boost::filtered_graph<const boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >&>, boost::keep_all, graph_tool::filter_vertex_pred>&>'
graph_trust_transitivity.hh:184:22: instantiated from 'void graph_tool::get_trust_transitivity::operator()(Graph&, VertexIndex, EdgeIndex, size_t, int64_t, int64_t, TrustMap, InferredTrustMap) const [with Graph = const boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >&>, VertexIndex = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, EdgeIndex = boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t>, TrustMap = boost::unchecked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, InferredTrustMap = boost::unchecked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, size_t = long unsigned int, int64_t = long int]'
/usr/include/boost/bind/bind.hpp:752:9: instantiated from 'void boost::_bi::list8<A1, A2, A3, A4, A5, A6, A7, A8>::operator()(boost::_bi::type<void>, const F&, A&, int) const [with F = graph_tool::get_trust_transitivity, A = boost::_bi::list3<const boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >&>&, const boost::unchecked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >&, const boost::unchecked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >&>, A1 = boost::arg<1>, A2 = boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, A3 = boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, A4 = boost::_bi::value<long unsigned int>, A5 = boost::_bi::value<long int>, A6 = boost::_bi::value<long int>, A7 = boost::arg<2>, A8 = boost::arg<3>]'
/usr/include/boost/bind/bind_template.hpp:137:48: instantiated from 'boost::_bi::bind_t<R, F, L>::result_type boost::_bi::bind_t<R, F, L>::operator()(const A1&, const A2&, const A3&) const [with A1 = boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >&>, A2 = boost::unchecked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, A3 = boost::unchecked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, R = void, F = graph_tool::get_trust_transitivity, L = boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> >, boost::_bi::bind_t<R, F, L>::result_type = void]'
./../graph_filtering.hh:580:7: [ skipping 12 instantiation contexts ]
/usr/include/boost/mpl/for_each.hpp:78:9: instantiated from 'static void boost::mpl::aux::for_each_impl<false>::execute(Iterator*, LastIterator*, TransformFunc*, F) [with Iterator = boost::mpl::v_iter<graph_tool::detail::graph_action<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, graph_tool::detail::all_graph_views, mpl_::bool_<false>, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::graph_view_pointers, 0l>, LastIterator = boost::mpl::v_iter<graph_tool::detail::graph_action<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, graph_tool::detail::all_graph_views, mpl_::bool_<false>, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::graph_view_pointers, 3l>, TransformFunc = boost::mpl::identity<mpl_::na>, F = boost::mpl::nested_for_each<graph_tool::detail::graph_action<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, graph_tool::detail::all_graph_views, mpl_::bool_<false>, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::graph_view_pointers, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::inner_loop1<boost::mpl::selected_types<graph_tool::detail::action_wrap<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, mpl_::bool_<false> > > >]'
/usr/include/boost/mpl/for_each.hpp:100:5: instantiated from 'void boost::mpl::for_each(F, Sequence*, TransformOp*) [with Sequence = graph_tool::detail::graph_action<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, graph_tool::detail::all_graph_views, mpl_::bool_<false>, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::graph_view_pointers, TransformOp = boost::mpl::identity<mpl_::na>, F = boost::mpl::nested_for_each<graph_tool::detail::graph_action<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, graph_tool::detail::all_graph_views, mpl_::bool_<false>, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::graph_view_pointers, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::inner_loop1<boost::mpl::selected_types<graph_tool::detail::action_wrap<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, mpl_::bool_<false> > > >]'
/usr/include/boost/mpl/for_each.hpp:111:5: instantiated from 'void boost::mpl::for_each(F, Sequence*) [with Sequence = graph_tool::detail::graph_action<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, graph_tool::detail::all_graph_views, mpl_::bool_<false>, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::graph_view_pointers, F = boost::mpl::nested_for_each<graph_tool::detail::graph_action<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, graph_tool::detail::all_graph_views, mpl_::bool_<false>, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::graph_view_pointers, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::inner_loop1<boost::mpl::selected_types<graph_tool::detail::action_wrap<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, mpl_::bool_<false> > > >]'
./../mpl_nested_loop.hh:75:9: instantiated from 'void boost::mpl::nested_for_each<TR1, TR2, TR3, TR4, TR5>::operator()(Action) const [with Action = boost::mpl::selected_types<graph_tool::detail::action_wrap<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, mpl_::bool_<false> > >, TR1 = graph_tool::detail::graph_action<boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, graph_tool::detail::all_graph_views, mpl_::bool_<false>, boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, boost::mpl::vector<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, mpl_::na, mpl_::na>, boost::mpl::vector<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, mpl_::na, mpl_::na> >::graph_view_pointers, TR2 = boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, TR3 = boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, TR4 = boost::mpl::vector<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, mpl_::na, mpl_::na>, TR5 = boost::mpl::vector<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, mpl_::na, mpl_::na>]'
./../graph_filtering.hh:641:9: instantiated from 'void graph_tool::detail::graph_action<Action, GraphViews, Wrap, TR1, TR2, TR3, TR4>::operator()(boost::any, boost::any) const [with Action = boost::_bi::bind_t<void, graph_tool::get_trust_transitivity, boost::_bi::list8<boost::arg<1>, boost::_bi::value<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::_bi::value<boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::_bi::value<long unsigned int>, boost::_bi::value<long int>, boost::_bi::value<long int>, boost::arg<2>, boost::arg<3> > >, GraphViews = graph_tool::detail::all_graph_views, Wrap = mpl_::bool_<false>, TR1 = boost::mpl::v_item<boost::checked_vector_property_map<long double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::v_item<boost::checked_vector_property_map<double, boost::adj_list_edge_property_map<boost::bidirectional_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_index_t, long unsigned int>, boost::edge_index_t> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, TR2 = boost::mpl::v_item<boost::checked_vector_property_map<std::vector<long double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::v_item<boost::checked_vector_property_map<std::vector<double>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>, 0>, TR3 = boost::mpl::vector<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, mpl_::na, mpl_::na>, TR4 = boost::mpl::vector<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, mpl_::na, mpl_::na>]'
graph_trust_transitivity.cc:44:60: instantiated from here
/usr/include/boost/graph/graph_traits.hpp:222:47: error: no type named 'graph_property_type' in 'const class boost::reverse_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, long unsigned int> >&>'
make[4]: *** [graph_trust_transitivity.lo] Error 1
make[4]: Leaving directory `/global/Fedora/Scientific/graph-tool-trunk/src/graph/centrality'
make[3]: *** [all-recursive] Error 1
make[3]: Leaving directory `/global/Fedora/Scientific/graph-tool-trunk/src/graph'
make[2]: *** [all-recursive] Error 1
make[2]: Leaving directory `/global/Fedora/Scientific/graph-tool-trunk/src'
make[1]: *** [all-recursive] Error 1
make[1]: Leaving directory `/global/Fedora/Scientific/graph-tool-trunk'
make: *** [all] Error 2
}}}
----
Thank you for your help,
Andreas
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/87>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-02-03T19:32:51[graph-tool-tickets] Ticket #86: "Error: agstrfree lost'' while using graph_tool.draw.draw_graph in multithreaded app
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/611
<pre>#86: "Error: agstrfree lost'' while using graph_tool.draw.draw_graph in multithreaded app
new defect
---------------------------------------------------------------------
Reporter: ujujinsan
Owner: tiago peixoto
Priority: minor
Milestone: (None)
---------------------------------------------------------------------
First of all I am not sure whether it's a defect or anything, but please read on:
I am using graph_tool extensively in my project, and I recently added creating
graphs in threads(thousands of graphs). During graph creation graph_tool.draw.draw_graph is called in order to acquire node location which is used later on.
After adding threading I get:
'Error: agstrfree lost'
For example:
Error: agstrfree lost \N
Error: agstrfree lost 0.3
Error: agstrfree lost #a40000
Error: agstrfree lost 0.105
Error: agstrfree lost 0.3
Error: agstrfree lost 0.105
Error: agstrfree lost 1.0
Error: agstrfree lost 8.0
Error: agstrfree lost 0.105
Error: agstrfree lost 0.3
Error: agstrfree lost \N
Error: agstrfree lost vee
Error: agstrfree lost 1.0
Error: agstrfree lost 8.0
Error: agstrfree lost \N
....
After many more lines
Boooom! --- Crash
I pinpointed the error to graph_tool.draw.draw_graph as the hex values were suspicious :3
I made some locks around that function call and all works flawlessly.
graphviz version : 2.26.3 (20100126.1600)
graph_tool version : 2.15
When I have some spare time I'll work on a minimal example.
But in the mean time any suggestions?
Maybe draw_graph just isn't thread-safe?
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/86>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-01-24T18:06:02[graph-tool-tickets] Ticket #85: Compile problem onUbuntu
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/608
<pre>#85: Compile problem on Ubuntu
new defect
---------------------------------------------------------------------
Reporter: gamma2< at >users.sourceforge.net
Owner: tiago peixoto
Priority: normal
Milestone: (None)
---------------------------------------------------------------------
I just compiled the source on Ubuntu, but I had to add
{{{
#include <boost/unordered_map.hpp>
}}}
in source/graph/gml.hh because the make process raised the following error:
{{{
In file included from graph_io.cc:38:0:
gml.hh:202:5: error: ‘unordered_map’ does not name a type
...more type definitions and errors relative to the previous line...
}}}
Please check if the problem is relative to graph_tool or boost includes, otherwise I should check my configuration.
--
Ticket URL: <URL:http://graph-tool.skewed.de/ticket/85>
graph-tool <URL:http://graph-tool.skewed.de/>
An efficient python module for graph analysis and manipulation.
_______________________________________________
graph-tool-tickets mailing list
graph-tool-tickets< at >skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool-tickets
</pre>graph-tool2012-01-09T21:34:14[graph-tool-tickets] #85: paleo diet - Become Thinner And Healthier With The Paleo Diet
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/607
<pre>#85: paleo diet - Become Thinner And Healthier With The Paleo Diet
----------------------------+---------------------------
Reporter: Everett Melton | Owner: tiago peixoto
Type: defect | Status: new
Priority: normal | Milestone:
Component: graph-tool | Version: 2.2
Keywords: |
----------------------------+---------------------------
Do you think you're tired of the ''' [http://www.aboutpaleodiet.org paleo
food list]''' you're on? So deprived from sacrificing the produce you want
to enjoy? Everyone has our recommended weight that you should maintain to
look good and feel good. It makes us feel light and balanced, allowing us
to transfer without having restrictions acknowledge that we can easily
since we're also in good shape. '''diet''' has evolved from the moments,
most of them claim they are helpful but once experimented with by weight
watchers, they may be just going for incorrect anticipation. There are
plenty of diets that individuals truly do know and have tried using, but
this didn't fulfill our targets. It provides for us the opinion of
frustration and melancholy. So, what could be rapid diet plan that
produces us slim down in the short time period?
In the long run nevertheless what makes a difference is no '''
[http://www.aboutpaleodiet.org paleo diet blog]''' or exercise routine but
wait, how you perceive yourself. When you8217re obese and once and for all
trying to lose weight any diet will look excellent, as well as The atkins
diet diet can guide you to drop some weight. When you slim the fat however
are nevertheless depressed then this bodyweight wasn8217t the trouble from
the beginning.
</pre>graph-tool2012-01-07T01:34:21[graph-tool-tickets] #85: Test this
http://comments.gmane.org/gmane.comp.science.graph.graph-tool.bugs/606
<pre>#85: Test this
------------------------+---------------------------
Reporter: locke411< at >… | Owner: tiago peixoto
Type: defect | Status: new
Priority: normal | Milestone:
Component: graph-tool | Version: 2.2
Keywords: |
------------------------+---------------------------
Hi
</pre>graph-tool2012-01-04T17:34:21Search EngineSearch the mailing list at Gmanequery
http://search.gmane.org/?group=$group=gmane.comp.science.graph.graph-tool.bugs