Alternatives and similar repositories for glam:

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

• grtlr / bubble-treemaps
  Implementation of Bubble Treemaps for Uncertainty Visualization.
  ☆91Updated 6 years ago
• uwdata / setcola
  High-Level Constraints for Graph Layout
  ☆73Updated 4 years ago
• uwgraphics / splatterjs
  A WebGL/JavaScript implementation of the Splatterplot research project.
  ☆40Updated 8 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• jxz12 / s_gd2
  Stress-based Graph Drawing by Stochastic Gradient Descent
  ☆46Updated 2 years ago
• HanKruiger / tsnetwork
  (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.
  ☆10Updated 5 years ago
• Nicola17 / High-Dimensional-Inspector
  Scalable analysis of large high-dimensional data
  ☆66Updated 5 years ago
• jpkli / p4
  P4: Portable Parallel Processing Pipeline
  ☆40Updated 4 years ago
• RoyalCaliber / vertexAPI2
  A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction
  ☆23Updated 10 years ago
• JosuaKrause / bubblesets-js
  A JavaScript implementation of Bubble Sets.
  ☆47Updated last year
• SciTechStrategies / OpenOrd
  OpenOrd: An Open-Source Toolbox for Large Graph Layout
  ☆21Updated 9 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 9 years ago
• karlsruhedraw / KaDraw
  This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).
  ☆10Updated last year
• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆26Updated 6 years ago
• spupyrev / gmap
  GMap: Graph-to-Map visualization tool
  ☆19Updated 3 years ago
• twosixlabs / d3-force-sampled
  A fast, simple, memory-efficient graph layout algorithm for visualizing networks in D3
  ☆50Updated 3 years ago
• eXascaleInfolab / PyCABeM
  Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…
  ☆19Updated 6 years ago
• bagrow / linkcomm
  Programs to identify link communities in complex networks
  ☆93Updated 4 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆94Updated last year
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• rpgove / greadability
  Graph layout readability metrics.
  ☆77Updated 6 years ago
• benmaier / tacoma
  Temporal networks in Python. Provides fast tools to analyze temporal contact networks and simulate dynamic processes on them using Gilles…
  ☆105Updated 4 years ago
• eren-ck / MultiscaleSnapshots
  Visual Analysis of Temporal Summaries in Dynamic Graphs (IEEE TVCG)
  ☆14Updated 2 years ago
• hornet-gt / hornetsnest
  High-Performance Streaming Graph Analytics on GPUs
  ☆31Updated 6 years ago
• uwdata / graphscape
  A directed graph model of the visualization design space, using Vega-Lite.
  ☆59Updated 2 years ago
• CadanoX / SplitStreams
  Visualization of hierarchical data structures changing over time.
  ☆19Updated 4 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 6 years ago
• HanKruiger / tsNET
  Source code accompanying the submission to EuroVis 2017
  ☆30Updated 9 months ago
• Caleydo / pathfinder
  Pathfinder is a tool for the visual exploration of paths in large graphs.
  ☆27Updated 6 years ago
• lmcinnes / hypergraph
  A library for hypergraphs and hypergraph algorithms
  ☆28Updated 9 years ago