Alternatives and similar repositories for glam

Users that are interested in glam are comparing it to the libraries listed below

• uwdata / setcola
  High-Level Constraints for Graph Layout
  ☆75Updated 5 years ago
• jpkli / p4
  P4: Portable Parallel Processing Pipeline
  ☆40Updated 4 years ago
• Basasuya / ogdf.js
  a graph layout js library depended on ogdf and emscripten
  ☆11Updated 4 years ago
• nblintao / ParaGraphL
  WebGL-powered Parallel Large-scale Graph Layout Visualization Framework
  ☆116Updated 7 years ago
• ZJUVAI / NetV.js
  A large-scaled network visualization library based on WebGL
  ☆90Updated 7 months ago
• marckhoury / mars
  A graph drawing tool for large graph visualization.
  ☆189Updated 7 years ago
• grtlr / bubble-treemaps
  Implementation of Bubble Treemaps for Uncertainty Visualization.
  ☆94Updated 6 years ago
• domargan / awesome-dynamic-graphs
  A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…
  ☆144Updated 2 years ago
• alex-87 / HyperGraphLib
  C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.
  ☆24Updated 3 years ago
• pdclab / peregrine
  Peregrine: A Pattern-Aware Graph Mining System
  ☆207Updated 9 months ago
• stingergraph / stinger
  The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…
  ☆214Updated 11 months ago
• upphiminn / jLouvain
  Louvain community detection for Javascript (http://arxiv.org/abs/0803.0476) (http://en.wikipedia.org/wiki/Community_structure#The_Louvain…
  ☆155Updated 4 years ago
• fredhohman / atlas
  Atlas: Local Graph Exploration in a Global Context
  ☆29Updated 6 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆18Updated 7 years ago
• HanKruiger / tsnetwork
  (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.
  ☆10Updated 6 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 10 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 9 months ago
• twosixlabs / d3-force-sampled
  A fast, simple, memory-efficient graph layout algorithm for visualizing networks in D3
  ☆52Updated 3 years ago
• JosuaKrause / bubblesets-js
  A JavaScript implementation of Bubble Sets.
  ☆50Updated last year
• tracyhenry / Kyrix
  Interactive details-on-demand data visualizations at scale
  ☆150Updated 2 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆80Updated 7 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆34Updated last year
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• uwgraphics / splatterjs
  A WebGL/JavaScript implementation of the Splatterplot research project.
  ☆39Updated 9 years ago
• pdclab / graphbolt
  GraphBolt: Dependency-Driven Synchronous Processing of Streaming Graphs
  ☆147Updated 4 years ago
• caesar0301 / graphsim
  Graph similarity algorithms based on NetworkX.
  ☆170Updated 6 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 4 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 4 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• yubowenok / visflow
  Web-based Dataflow Framework for Visual Data Exploration
  ☆124Updated 2 years ago