Stack Overflow
Stack Overflow

Questions tagged [lightgraphs]

22 questions
1
vote
2 answers

Networkx "ancestor" equivalence in Julia LightGraphs

Is there a LightGraph function in Julia which is equivalent to ancestors function in Networkx?
decardinb
  • 160
  • 9
1
vote
2 answers

Julia LightGraphs weakly_connected_components

Isn't it true that the weakly_connected_components in julia LightGraphs should provide connected components where if The DiGraph is turned into an undirected graph, then each component should be connected? I have tried this and I do not receive such…
A.Yazdiha
  • 1,336
  • 1
  • 14
  • 29
0
votes
2 answers

3-dimensional graph LightGraphs/GraphPlot/Julia or Networkx/Python

I am wondering whether it is possible to plot a vertical bar over a 2-dimensional representation of a graph. Say I have a tree and I want to associate with any node a "potential" which can be represented as a vertical bar.
dapias
  • 2,512
  • 3
  • 15
  • 23
0
votes
0 answers

Error using LightGraphs on Atom with Julia

I am having troubles trying to use LightGraphs with Atom. When I try using LightGraphs I get ERROR: MethodError: no method matching shouldlog(::Atom.Progress.JunoProgressLogger, ::Base.CoreLogging.LogLevel, ::Module, ::Symbol, ::Symbol) The …
ChrlTsr
  • 149
  • 1
  • 7
0
votes
0 answers

How to add element-wise edges between two sets of vertices in Julia

After running the command connected_components on an undirected graph g with LightGraphs in Julia, I obtain the following result: 9-element Array{Array{Int64,1},1}: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10 … 41, 42, 43, 44, 45, 46, 47, 48, 49, 50] [51,…
coolsv
  • 781
  • 5
  • 16
-1
votes
2 answers

Why does LightGraphs.betweenness_centrality() run so long

When I try to calculate the betweenness_centrality() of my SimpleWeightedGraph with julia's LightGraphs package it runs indefinitely. It keeps on increasing it's RAM usage until at some point it crashes without an error message. Is the something…
Jonas
  • 1,401
  • 9
  • 25
-2
votes
1 answer

length of the shortest path to all other nodes

I have a network's data in tabular form (like in the screenshot) and would like to implement the Bellman-Ford algorithm on that. Every existing code for this is implemented to use an adjacency matrix. My file is in the form of an incidence…
user9990604
1
2