# Graphs

**URL:** https://discourse.julialang.org/c/domain/graphs/73.md?page=4

[Latest](https://discourse.julialang.org/latest.md) · [Categories](https://discourse.julialang.org/categories.md) · [Tags](https://discourse.julialang.org/tags.md)

**Page:** 5

---

## [Normalized laplacian of weighted graphs](https://discourse.julialang.org/t/normalized-laplacian-of-weighted-graphs/42064)

<div class="topic-metadata">

**Author:** [@Neurovium](https://discourse.julialang.org/u/Neurovium)\
**Replies:** 1\
**Last updated:** [June 25, 2020, 8:55pm UTC](https://discourse.julialang.org/t/normalized-laplacian-of-weighted-graphs/42064 "2020-06-25T20:55:26Z")

</div>

Hi, Is there anyway to calculate normalized laplacian for a weighted graph? See below for an example graph created with SimpleWeightedGraphs (https://github.com/JuliaGraphs/SimpleWeightedGraphs.jl) When I call Normal…

---

## [Identifying nodes in a Graph](https://discourse.julialang.org/t/identifying-nodes-in-a-graph/41498)

<div class="topic-metadata">

**Author:** [@danielw2904](https://discourse.julialang.org/u/danielw2904)\
**Replies:** 4\
**Last updated:** [June 17, 2020, 10:13pm UTC](https://discourse.julialang.org/t/identifying-nodes-in-a-graph/41498 "2020-06-17T22:13:13Z")

</div>

Hi, I have data on users for whom I’d like to create a bipartite network that connects them through their consumption decisions. Since the data is rather big I’m trying to find an efficient implementation to create the …

---

## [LightGraphs: inconsistency between weighted and non-weighted graphs?](https://discourse.julialang.org/t/lightgraphs-inconsistency-between-weighted-and-non-weighted-graphs/41223)

<div class="topic-metadata">

**Author:** [@gmouts](https://discourse.julialang.org/u/gmouts)\
**Replies:** 7\
**Last updated:** [June 11, 2020, 8:46pm UTC](https://discourse.julialang.org/t/lightgraphs-inconsistency-between-weighted-and-non-weighted-graphs/41223 "2020-06-11T20:46:30Z")

</div>

I want to get the unweighted adjacency matrix from a weighted graph. I thought that weighs gives the weighted adjacency matrix and adjacency\_matrix gives the unweighted adjacency matrix. I found out this is not true: gw…

---

## [Problem LightGraphs creating graphs and accessing vertices LightGraphs](https://discourse.julialang.org/t/problem-lightgraphs-creating-graphs-and-accessing-vertices-lightgraphs/40804)

<div class="topic-metadata">

**Author:** [@Florent\_Poux](https://discourse.julialang.org/u/Florent_Poux)\
**Replies:** 1\
**Last updated:** [June 5, 2020, 11:25am UTC](https://discourse.julialang.org/t/problem-lightgraphs-creating-graphs-and-accessing-vertices-lightgraphs/40804 "2020-06-05T11:25:49Z")

</div>

Hi, I struggle to have a reliable behavior using Lightgraphs. Yesterday, I could plot some graphs based on some arrays I had, but impossible to use the command “vertices(G)” for example (returned: UndefVarError: vertice…

---

## [Random graphs, fully-connected graphs](https://discourse.julialang.org/t/random-graphs-fully-connected-graphs/40445)

<div class="topic-metadata">

**Author:** [@erlebach](https://discourse.julialang.org/u/erlebach)\
**Replies:** 17\
**Last updated:** [May 31, 2020, 2:47pm UTC](https://discourse.julialang.org/t/random-graphs-fully-connected-graphs/40445 "2020-05-31T14:47:00Z")

</div>

Hi, How does one create a fully connected graph with LightGraphs.jl? I looked at the documentation and did not see an obvious function. A second equation is how to create a random graph with p percent of the edges? I …

---

## [Networkx & lightgraphs.jl shortest path benchmark](https://discourse.julialang.org/t/networkx-lightgraphs-jl-shortest-path-benchmark/39245)

<div class="topic-metadata">

**Author:** [@zhangliye](https://discourse.julialang.org/u/zhangliye)\
**Replies:** 7\
**Last updated:** [May 11, 2020, 4:36pm UTC](https://discourse.julialang.org/t/networkx-lightgraphs-jl-shortest-path-benchmark/39245 "2020-05-11T16:36:20Z")

</div>

I have developped a small package (GraphMLReader.jl ) to load GraphML file to MetaGraph, which keep all the attributes of nodes and edges. I compare the speed of reading GraphML file and dijkstra shortest path of network…

---

## [LightGraphs users (and other interested parties): please opine below](https://discourse.julialang.org/t/lightgraphs-users-and-other-interested-parties-please-opine-below/37660)

<div class="topic-metadata">

**Author:** [@anon94023334](https://discourse.julialang.org/u/anon94023334)\
**Replies:** 25\
**Last updated:** [April 25, 2020, 4:21pm UTC](https://discourse.julialang.org/t/lightgraphs-users-and-other-interested-parties-please-opine-below/37660 "2020-04-25T16:21:23Z")

</div>

Not quite sure how to narrow down the audience to interested parties, so I’m placing this here. LightGraphs 2.0 is in active development. One of the big changes is the movement of functions into separate submodules. (In…

---

## [Bipartite weighted network](https://discourse.julialang.org/t/bipartite-weighted-network/35985)

<div class="topic-metadata">

**Author:** [@mp-crypto](https://discourse.julialang.org/u/mp-crypto)\
**Replies:** 7\
**Last updated:** [March 16, 2020, 3:17pm UTC](https://discourse.julialang.org/t/bipartite-weighted-network/35985 "2020-03-16T15:17:31Z")

</div>

Hello, I am new to Julia (moving from Python). I am trying to generate a bipartite weighted network from a data frame. The data frame contains the “edgelist” (i.e., a column for bottom nodes, and a column for top nodes)…

---

## [Deleting edges from SimpleWeightedDiGraph based on edge weight](https://discourse.julialang.org/t/deleting-edges-from-simpleweighteddigraph-based-on-edge-weight/35835)

<div class="topic-metadata">

**Author:** [@Jakob](https://discourse.julialang.org/u/Jakob)\
**Replies:** 4\
**Last updated:** [March 12, 2020, 3:27pm UTC](https://discourse.julialang.org/t/deleting-edges-from-simpleweighteddigraph-based-on-edge-weight/35835 "2020-03-12T15:27:49Z")

</div>

Hi, i would like to remove multiple edges from a SimpleWeightedDiGraph based on their weight. However, naively looping over edges as in the example below does not yield the desired result, presumably because the intern…

---

## [Specifying integer edge weights in SimpleWeightedGraph](https://discourse.julialang.org/t/specifying-integer-edge-weights-in-simpleweightedgraph/33315)

<div class="topic-metadata">

**Author:** [@rkurchin](https://discourse.julialang.org/u/rkurchin)\
**Replies:** 1\
**Last updated:** [January 13, 2020, 9:01pm UTC](https://discourse.julialang.org/t/specifying-integer-edge-weights-in-simpleweightedgraph/33315 "2020-01-13T21:01:43Z")

</div>

Hi, I hope this is the right place to post this. It’s sort of a followup to this question but on a somewhat different aspect. In particular, I want to construct a SimpleWeightedGraph (which will eventually be passed to …

---

## [Is dijkstra\_shortest\_paths only supposed to handle integer weights?](https://discourse.julialang.org/t/is-dijkstra-shortest-paths-only-supposed-to-handle-integer-weights/31761)

<div class="topic-metadata">

**Author:** [@HBreddam](https://discourse.julialang.org/u/HBreddam)\
**Replies:** 2\
**Last updated:** [December 2, 2019, 5:54pm UTC](https://discourse.julialang.org/t/is-dijkstra-shortest-paths-only-supposed-to-handle-integer-weights/31761 "2019-12-02T17:54:54Z")

</div>

Hi everyone, I need to have float weight on a graph as it is used as a pricing problem for column generation. As far as i can see the dijkstra\_shortest\_paths should be able use float weight, but when i try the followin…

---

## [Plotting graphs, using GraphPlot](https://discourse.julialang.org/t/plotting-graphs-using-graphplot/30973)

<div class="topic-metadata">

**Author:** [@marinarrd](https://discourse.julialang.org/u/marinarrd)\
**Replies:** 3\
**Last updated:** [November 12, 2019, 6:21pm UTC](https://discourse.julialang.org/t/plotting-graphs-using-graphplot/30973 "2019-11-12T18:21:41Z")

</div>

Hello, I would like to draw a graph with node and edge labels. I am stuck as when I call gplot no edges appear in my graph. I attatched an image of my graph as well as what I would like using LightGraphs using GraphPlo…

---

## [How can I read a MetaGraph in GML format?](https://discourse.julialang.org/t/how-can-i-read-a-metagraph-in-gml-format/30786)

<div class="topic-metadata">

**Author:** [@Diego\_Javier\_Zea](https://discourse.julialang.org/u/Diego_Javier_Zea)\
**Replies:** 0\
**Last updated:** [November 6, 2019, 10:18am UTC](https://discourse.julialang.org/t/how-can-i-read-a-metagraph-in-gml-format/30786 "2019-11-06T10:18:26Z")

</div>

Hi! I have a graph with edge and node metadata in GML format, how can I read it into a MetaGraph? Thanks in advance,

---

## [Normalized Laplacian with LightGraphs.jl](https://discourse.julialang.org/t/normalized-laplacian-with-lightgraphs-jl/24748)

<div class="topic-metadata">

**Author:** [@andferrari](https://discourse.julialang.org/u/andferrari)\
**Replies:** 0\
**Last updated:** [May 29, 2019, 9:08pm UTC](https://discourse.julialang.org/t/normalized-laplacian-with-lightgraphs-jl/24748 "2019-05-29T21:08:00Z")

</div>

I want to compute the Normalized Laplacian of a graph g. Is there something more straightforward than? adjmat = LightGraphs.LinAlg.CombinatorialAdjacency(adjacency\_matrix(g)) Ln = I - Diagonal(adjmat.D.^(-1/2))\*(adjmat…

---

## [Graph construction performance](https://discourse.julialang.org/t/graph-construction-performance/24288)

<div class="topic-metadata">

**Author:** [@Azamat](https://discourse.julialang.org/u/Azamat)\
**Replies:** 2\
**Last updated:** [May 16, 2019, 6:15pm UTC](https://discourse.julialang.org/t/graph-construction-performance/24288 "2019-05-16T18:15:15Z")

</div>

I need to construct a dense weighted undirected graph with ~20,000 vertices. Currently, I have the following code using LightGraphs, SimpleWeightedGraphs function main(n) g = SimpleWeightedGraph(n) for u ∈ verti…

---

## [Small world index computation](https://discourse.julialang.org/t/small-world-index-computation/24024)

<div class="topic-metadata">

**Author:** [@pegger0709](https://discourse.julialang.org/u/pegger0709)\
**Replies:** 0\
**Last updated:** [May 9, 2019, 11:57am UTC](https://discourse.julialang.org/t/small-world-index-computation/24024 "2019-05-09T11:57:03Z")

</div>

Hello, I was just wondering whether LightGraphs has a function to compute the small-world index of a graph (like networkx does, but hopefully faster…) Thanks, Philip

---

## [How to construct a MetaGraph from a weighted adjacency matrix](https://discourse.julialang.org/t/how-to-construct-a-metagraph-from-a-weighted-adjacency-matrix/23996)

<div class="topic-metadata">

**Author:** [@pegger0709](https://discourse.julialang.org/u/pegger0709)\
**Replies:** 2\
**Last updated:** [May 9, 2019, 11:41am UTC](https://discourse.julialang.org/t/how-to-construct-a-metagraph-from-a-weighted-adjacency-matrix/23996 "2019-05-09T11:41:58Z")

</div>

Hello, I am a researcher studying structural brain networks of stroke patients. I have some connectomes which are given as symmetric weighted matrices, e.g. (as a random example) julia\> X = rand(300,300); C = Symmetric…

---

## [Trying to identify possible optimizations (or errors) in a graph algorithm](https://discourse.julialang.org/t/trying-to-identify-possible-optimizations-or-errors-in-a-graph-algorithm/19998)

<div class="topic-metadata">

**Author:** [@opera\_malenky](https://discourse.julialang.org/u/opera_malenky)\
**Replies:** 24\
**Last updated:** [January 31, 2019, 11:09am UTC](https://discourse.julialang.org/t/trying-to-identify-possible-optimizations-or-errors-in-a-graph-algorithm/19998 "2019-01-31T11:09:34Z")

</div>

I am trying to re-implement (in Julia) some old C++ code I wrote a while ago to do certain operations on graphs, however, I’m not confident the performance is as good as I remember it… I was hoping someone might be able …

---

## [Coloring Graphs with Lightgraphs](https://discourse.julialang.org/t/coloring-graphs-with-lightgraphs/18521)

<div class="topic-metadata">

**Author:** [@AlexWue](https://discourse.julialang.org/u/AlexWue)\
**Replies:** 2\
**Last updated:** [December 13, 2018, 2:03pm UTC](https://discourse.julialang.org/t/coloring-graphs-with-lightgraphs/18521 "2018-12-13T14:03:19Z")

</div>

Hi all, i am writing a paper in college about optimization problems in Julia. Regarding a network flow problem i would like to create a colored graph for visualization. I managed to visualize the nodes and edges with …

---

## [GraphIO and MetaGraphs](https://discourse.julialang.org/t/graphio-and-metagraphs/17048)

<div class="topic-metadata">

**Author:** [@cdsousa](https://discourse.julialang.org/u/cdsousa)\
**Replies:** 3\
**Last updated:** [November 5, 2018, 5:42pm UTC](https://discourse.julialang.org/t/graphio-and-metagraphs/17048 "2018-11-05T17:42:57Z")

</div>

Hi, Is it possible to save (and load) MetaGraphs graphs to common formats while maintaining the metadata?

---

## [Graphs, k-centers and recursion](https://discourse.julialang.org/t/graphs-k-centers-and-recursion/11556)

<div class="topic-metadata">

**Author:** [@JakobPeterlin](https://discourse.julialang.org/u/JakobPeterlin)\
**Replies:** 6\
**Last updated:** [June 10, 2018, 1:19pm UTC](https://discourse.julialang.org/t/graphs-k-centers-and-recursion/11556 "2018-06-10T13:19:21Z")

</div>

Hello! I have been recently trying to improve the performance of the classic brute force algorithm for k-centers in a simple graph. My reasons for this are not really that serious, I was only trying to reach the speed o…

[Previous page](https://discourse.julialang.org/c/domain/graphs/73.md?page=3)