[{"data":1,"prerenderedAt":128},["ShallowReactive",2],{"project-8767279":3},{"id":4,"name":5,"line":6,"line_source":7,"title":8,"url":9,"domain":10,"maker":11,"posted_at":12,"year":13,"points":14,"comments":15,"rank_in_year":16,"shown_in_year":17,"top":18,"tier":19,"category":20,"subcategory":21,"format":22,"keywords":23,"reception":28,"sentiment":29,"stance_mix":30,"scored_comments":31,"aspects":33,"strip":35,"post_text":29,"what":37,"said":56,"maker_in_thread":77,"shape":80,"grid":83,"attempts":90,"same_week":91,"maker_shows":120,"maker_hidden":121,"reader_version":122,"card":123},"8767279","dynamic-forest","Dynamic graph connectivity data structure","title","Show HN: Dynamic graph connectivity data structure","https:\u002F\u002Fgithub.com\u002Fmikolalysenko\u002Fdynamic-forest","github.com","33a",1418912472,2014,25,3,1101,2272,49,"shown","languages","graph algorithms library","library",[24,25,26,27],"dynamic graph connectivity","spanning forest","connected components","graph data structure","quiet",null,{"positive":31,"neutral":32,"mixed":32,"critical":32},1,0,{"performance":34},{"positive":31,"critical":32},[32,32,36],5,{"problem":38,"audience":45,"pricing":29,"motivation":29,"time_to_build":29,"stack":54,"openness":55,"stage":55,"team_size":55},{"value":39,"source":40,"evidence":41},"Answering connectivity queries on graphs with edges added and removed efficiently","maker",[42],{"id":43,"by":11,"text":44},"8768148","The advantage of using the library is that you would be able to answer connectivity queries and traverse the connected components of the graph efficiently. EDIT: If you want an…",{"value":46,"source":47,"evidence":48},"Developers working on graph analytics or physics simulations with changing links","commenter",[49,50],{"id":43,"by":11,"text":44},{"id":51,"by":52,"text":53},"8768286","sherbet","There are several well-known space and time efficient data-structures that answer membership\u002Fconnectivity queries. The main drawback has typically been that whilst they can be…",[],"unknown",{"praise":57,"objections":62,"requests":63,"questions":71,"alternatives":76},[58],{"value":59,"source":47,"evidence":60},"Good time and space properties for fully dynamic connectivity",[61],{"id":51,"by":52,"text":53},[],[64],{"value":65,"source":47,"evidence":66},"Explain the use case and advantages",[67],{"id":68,"by":69,"text":70},"8767912","iandanforth","I'd like to know more about the use-case and advantages here. Anyone have professional experience with the cost\u002Fdifficulty of maintaining spanning forests?",[72],{"value":73,"source":47,"evidence":74},"What is the cost and difficulty of maintaining spanning forests in practice",[75],{"id":68,"by":69,"text":70},[],{"comments":31,"answered":31,"key":78},[79],{"id":43,"text":44},{"commenters":15,"max_depth":81,"maker_replies":31,"first_comment_mins":82,"lifespan_hours":15},2,109,[84,86,88],[68,32,32,85,69,32],"commenter\u002Fneutral\u002Fnone",[43,32,32,87,11,31],"project\u002Fneutral\u002Fidea",[51,32,36,89,52,32],"project\u002Fpositive\u002Fperformance",[],[92,97,102,106,111,116],{"id":93,"name":94,"points":95,"category":96},"8766865","Wysihtml",215,"dev_tools",{"id":98,"name":99,"points":100,"category":101},"8787733","Startup Fighter",117,"games",{"id":103,"name":104,"points":82,"category":105},"8787783","Espion","web_saas",{"id":107,"name":108,"points":109,"category":110},"8774257","ping.gg",95,"infrastructure",{"id":112,"name":113,"points":114,"category":115},"8782320","reread",81,"consumer_social",{"id":117,"name":118,"points":119,"category":20},"8790970","Chicory",76,7,false,"v2",{"id":124,"name":5,"line":6,"ai":121,"cat":20,"year":13,"points":14,"comments":15,"rec":28,"s":29,"top":18,"kw":125,"maker":11,"domain":10,"tier":19,"attempts":32,"strip":126,"url":9,"mix":127,"praise":59,"objection":-1,"sub":21},8767279,[24,25,26,27],"005",[31,32,32,32],1793990917009]