Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Repo info
Activity
    [slack] <jpfairbanks> modularity maximization is not in the docs, but would be a good PR.
    Seth Bromberger
    @sbromberger
    ok, so I'm now over in gitter.
    Andreas Peter
    @under-Peter
    Any idea for a graph generator that's likely to have multiple strongly connected components? I'm playing around with the different graph generators but so far I haven't managed to randomly get one with multiple clusters (that are not just some single lost vertices connected to nothing)
    BridgingBot
    @GitterIRCbot
    [slack] <simonschoelly> what do you need such a graph for? is it important, that you can generate multiple random graphs, our could you also take a real world graph that has these characteristics?
    [slack] <simonschoelly> then choose an ordering on these connected components
    [slack] <simonschoelly> and then add random edges between the components, so that this ordering is respected
    Andreas Peter
    @under-Peter
    Just playing around :) I thought one of the named graph generators might be suitable but I'll take real world examples too.
    BridgingBot
    @GitterIRCbot
    [slack] <sbromberger> It seems to me that core_periphery_deg should not be in Community but should be in Connectivity (where period, kcore, etc. are). Thoughts?
    [slack] <sbromberger> perhaps not, but it really doesn't seem to be related to communities.
    [slack] <sbromberger> or maybe Degeneracy
    [slack] <sbromberger> I'll keep it where it is for now
    radium42
    @radium42
    Hi! Im having trouble calculating the edge betweenness of a graph with LighGraphs. Is there a quick way to do this?
    BridgingBot
    @GitterIRCbot
    [slack] <sbromberger> we don't currently have edge betweenness as a method.
    Gordon Erlebacher
    @erlebach
    I would like to merge two graphs. Consider the following scenario. I have N nodes 1:N, and I create a G1=SimpleGraph(100,10) with nodes 1:100, and a G2=SimpleGraph(200,10) with nodes 50:200. I expect some edges to overlap. Obviously, this approach does not work because for G1, the nodes are numbered 1 through 100, while in G2, the nodes are numbered 1 through 150. MetaGraphs seems to be the right way to accomplish my task. Is there a better and perhaps more efficient way? Thanks.
    Mathieu Besançon
    @matbesancon
    I'm not sure it's clear what rule you are using for merging
    Eddie Schoute
    @eddieschoute

    Maybe a silly question but if I do

    for neighbor in neighbors(g, v)
    rem_edge!(g, v, neighbor)
    end

    then I get unexpected behavior. For example, it will not delete the second neighbor of v. I think because the neighborhood is mutated while iterating. Is this expected?

    Mathieu Besançon
    @matbesancon
    If I recall neighbors returns an iterator that is valid while the graph isn't modified
    The iterator returned may depend on the graph type
    Eddie Schoute
    @eddieschoute
    In my case it's a digraph
    Might be good to throw an exception if the iterator is modified while iterating? Like a ConcurrentModificationException in Java
    Eddie Schoute
    @eddieschoute
    Looks like in Julia a copy is made of the underlying datastructure for e.g. Sets so that any modifications on x = Set([1,2,3]) are not reflected in it = iterate(x) if I do delete!(x, 3) after calling iterate
    BridgingBot
    @GitterIRCbot
    [slack] <jpfairbanks> Yes that is the expected behavior, there should be a warning in the docs
    CaseyKneale
    @CaseyKneale_twitter
    is there a preferred way to "join" two graph instances(say simple digraphs)?
    G_1: A->B->C , G_2: B->D->C, G_universe = {G_1,G_2}
    ie: G_universe = A->B->(D->)C
    the naive solution is just to use a loop and look for matching IDX's using MetaDiGraphs (IE each node has a unique label)
    CaseyKneale
    @CaseyKneale_twitter
    actually nevermind the problem I have involves depthwise stacks of tensors which can be flattened but the rules for making an adjacency graph aren't exactly consistent with simple merging... Back to ze drawing board.
    Kanishk
    @kanishk509
    Hello, Kanishk here.
    I'm new to Julia and was trying to tinker with the LightGraphs library.
    I forked and cloned the repo, then I was trying to include my local copy of the module by doing:
    include("./src/LightGraphs.jl")
    After installing the required dependencies, I'm running into this error:
    WARNING: could not import LightGraphs.has_contiguous_vertices into SimpleGraphsCore
    ERROR: LoadError: LoadError: UndefVarError: is_graphical not defined
    Stacktrace:
     [1] include(::Module, ::String) at ./Base.jl:377
     [2] include(::String) at /home/kanishk509/code/LightGraphs.jl/src/LightGraphs.jl:1
     [3] top-level scope at /home/kanishk509/code/LightGraphs.jl/src/LightGraphs.jl:189
     [4] include(::String) at ./client.jl:439
     [5] top-level scope at REPL[5]:1
    in expression starting at /home/kanishk509/code/LightGraphs.jl/src/Generators/Generators.jl:6
    in expression starting at /home/kanishk509/code/LightGraphs.jl/src/LightGraphs.jl:189
    I can see that is_graphicalis defined in src/utils.jl
    Kanishk
    @kanishk509
    What is the recommended workflow for testing out changes that I've made to the library locally?
    Kanishk
    @kanishk509
    Oh I think I figured it out. Using the package manager to add the local repo did the trick.
    Ole Kröger
    @Wikunia
    Correct and you should use ] dev instead of add if you haven't already.
    Diego Tapias
    @dapias
    Hello! I am wondering about how to compute thee distance between a pair of nodes, say nodes "i" and "j"
    This is a minimal example for say nodes 2 and 12 from a Random Regular Graph with connectivity 3
    julia> using LightGraphs
    julia> L = random_regular_graph(100, 3) 
    julia> paths= dijkstra_shortest_paths(L, 2)
    julia> distances = paths.dists
    julia> d = distances[12]
    Diego Tapias
    @dapias
    The problem with this approach is that I have to calculate the distances between all the nodes and my node 2 in order to know the distance between my two nodes of interest
    Ole Kröger
    @Wikunia
    You could use a_star for that.
    Diego Tapias
    @dapias
    Many thanks!
    Ghost
    @ghost~5e9b5adcd73408ce4fe0ea4c
    Is there a way to get multi-graphs?
    I want my graphs to have duplicate edges.
    Kanishk
    @kanishk509
    Hello all.
    Sometime back, there was a discussion on LightGraphs github about a DAG (Directed Acyclic Graph) package.
    I had submitted a PR implementing a linear time shortest path algo for DAGs. After some talk with @sbromberger and @jpfairbanks , it seemed a DAG package might be useful in JuliaGraphs.
    Relevant issue: JuliaGraphs/LightGraphs.jl#1485
    PR: JuliaGraphs/LightGraphs.jl#1486
    I wanted to ask whether someone from the org might be willing to mentor a GSoC project based on this?
    I'm interested in working on this as a student.
    Sawyer Welden
    @sawyerWeld
    Hello, i'm new to lightgraphs. Can anyone tell me what would be best practice to use if I need an arbitrary cycle from a graph? I could use the first cycle from simplecycles_iter but that seems wasteful. The graphs are small (nv < 10) and I know that there must be a cycle.
    Matthew Pocock
    @drdozer
    hi - I'm having problems with adding dependencies
    I'm trying to add Crayons to my project
    it keeps adding it to [deps] in my Project.toml and then complaining that Crayons isn't in Base
    Matthew Pocock
    @drdozer
    oh sorry - wrong room
    BridgingBot
    @GitterIRCbot
    [slack] <MiguelRaz> Can Anyone can ping?