igraph-help
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] computing betweenness for weighted network


From: Tamas Nepusz
Subject: Re: [igraph] computing betweenness for weighted network
Date: Wed, 4 May 2016 16:13:28 +0200

> Are there any standards for the edge and vertex attributes?  For
> example, can I assume that for a simple weighted graph the edge weight
> will always be called "weight"?  Or are there no guarantees?
Weights are always stored in "weight" (edge attribute) and vertex
names are always stored in "name" - this is because igraph's
is_named() and is_weighted() methods also look for these attributes.
Also, for bipartite graphs, the two parts of the graph are encoded in
the "type" vertex attribute.

T.



reply via email to

[Prev in Thread] Current Thread [Next in Thread]