Right. Thanks. I appreciate the solution about iterating over the edges. I
hadn't thought of that because I had forgotten that one could easily extract
the neighbors of a vertex.
I didn't mean to imply that I was just looking for some solution using the
details of the package. I see your point
Hi all,
I have a temporal graph G carrying a vertex property map 'time' which is an
integer representing the order in which vertices joined the graph. For each
integer time from 1 until n (n = the final size of the graph) I want to
calculate the number of leaves which exist in the graph up until
On 06.12.2016 20:29, gogurt wrote:
> Hi all,
>
> I have a temporal graph G carrying a vertex property map 'time' which is an
> integer representing the order in which vertices joined the graph. For each
> integer time from 1 until n (n = the final size of the graph) I want to
> calculate the
On 06.12.2016 23:10, bloodymeli wrote:
> Hi,
>
> Alas, still no compilation. Our's IT response:
>
> tried :
> ./configure CPPFLAGS="-I/usr/include/cairomm-1.0/cairomm/"
> make
>
> and now got :
>
> graph_cairo_draw.cc:38:29: fatal error: cairomm/context.h: No such file or
> directory
>
Hi Alex,
Thanks for your input. I see what you mean, but my issue is that I'm viewing
the graph from the end *after it's been created.*
I'm not performing this calculation as the graph is being created. I'm being
handed a graph with the vertex creation times, so I need to step back
through the
Thank you once again.
I apologize for re-consulting, but our IT manager failed to install again
(arghh).
I'm forwarding his message:
I set the environment to use the newer python and numpy, and corrected the
boost library to work with it.
Configure worked OK but now make failed in searching
On 06.12.2016 07:40, COMEGETME wrote:
> After running an inference method such as:
> graph_tool.inference.minimize_blockmodel_dl()
> I get back a graph_tool.inference.BlockState,
> which provides a PropertyMap on the vertices
> which i can use to tell which group a vertex is in.
> However, if i
On 06.12.2016 23:26, gogurt wrote:
> I'm not performing this calculation as the graph is being created. I'm being
> handed a graph with the vertex creation times, so I need to step back
> through the history of the graph to recover which vertices connected to
> which vertices anyway. Won't that
