DiagrammeR (Q42752)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Graph/Network Visualization
Language Label Description Also known as
default for all languages
No label defined
    English
    DiagrammeR
    Graph/Network Visualization

      Statements

      0 references
      1.0.9
      5 March 2022
      0 references
      1.0.10
      18 May 2023
      0 references
      0.1
      9 January 2015
      0 references
      0.4
      30 January 2015
      0 references
      0.5
      19 March 2015
      0 references
      0.6
      30 April 2015
      0 references
      0.7
      11 June 2015
      0 references
      0.8.1
      13 October 2015
      0 references
      0.8.2
      1 February 2016
      0 references
      0.8.3
      16 July 2016
      0 references
      0.8.4
      17 July 2016
      0 references
      0.8
      8 October 2015
      0 references
      0.9.0
      4 January 2017
      0 references
      0.9.1
      21 August 2017
      0 references
      0.9.2
      6 September 2017
      0 references
      1.0.0
      1 March 2018
      0 references
      1.0.1
      22 April 2019
      0 references
      1.0.5
      16 January 2020
      0 references
      1.0.6.1
      8 May 2020
      0 references
      1.0.7
      15 January 2022
      0 references
      1.0.8
      24 January 2022
      0 references
      1.0.11
      2 February 2024
      0 references
      1.0.11
      3 February 2024
      0 references
      PACKAGES.rds
      9 July 2026
      0 references
      1.0.12
      27 April 2026
      0 references
      0 references
      Build graph/network structures using functions for stepwise addition and deletion of nodes and edges. Work with data available in tables for bulk addition of nodes, edges, and associated metadata. Use graph selections and traversals to apply changes to specific nodes or edges. A wide selection of graph algorithms allow for the analysis of graphs. Visualize the graphs and take advantage of any aesthetic properties assigned to nodes and edges.
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      Olivier Roy
      0 references
      27 April 2026
      0 references

      Identifiers