[Python] python networkx: do networkx's centrality algorithms use a weighted adjacency matrix?

I'm using networkx to compute a couple centrality statistics for a weighted graph (eigenvector centrality, and katz centrality). The documentation for these methods mention the graph's adjacency matrix, but do they use the weighted or unweighted version of this matrix?

Continue reading...