Does anyone know how to get the laplacian matrix of an undirected and weighted graph?
I know for a simple undirected graph , we can use graph.laplacian(g) to get it, but I need to add weight to each edge, then how to get the laolacian of a weighted graph?
Can I add weight to the attribute of edge like E(g)$ weight<- wt , then
get adjacency matrix first....I am lost...
Can anyone give me a clue?