DiagrammeR (Q42752): Difference between revisions

From MaRDI portal
Created claim: source code repository (P339): https://github.com/cran/DiagrammeR, #quickstatements; #temporary_batch_1711027662947
Swh import (talk | contribs)
SWHID from Software Heritage
 
Property / Software Heritage ID
 
Property / Software Heritage ID: swh:1:snp:37d26cfa0c3485f43d586747d141fa7b325ce55f / rank
 
Normal rank
Property / Software Heritage ID: swh:1:snp:37d26cfa0c3485f43d586747d141fa7b325ce55f / qualifier
 
Property / Software Heritage ID: swh:1:snp:37d26cfa0c3485f43d586747d141fa7b325ce55f / qualifier
 
point in time: 16 February 2024
Timestamp+2024-02-16T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0

Latest revision as of 23:33, 21 March 2024

Graph/Network Visualization
Language Label Description Also known as
English
DiagrammeR
Graph/Network Visualization

    Statements

    0 references
    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
    0 references
    0 references
    2 February 2024
    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