christophergandrud / christophergandrud/networkD3

Feature request: diagonal networks with multiple root nodes and node/edge data frames

Open
#253 1 comment 0 reactions 0 assignees View on GitHub
diagonalNetwork feature request sankeyNetwork support request
Dominant language
R
Stars
659
Forks
259
PR merge metrics
No merged PRs in 30d

Description

Diagonal networks would be an *amazing* addition to [`drake`](https://github.com/ropensci/drake)'s dependency graph visualizations. However, there are two obstacles:

1. The `List` data structure, which I would have to compute using the existing `Nodes` and `Links` data frames.
2. The requirement that we have only a single root node.

Is there a way to easily transition from `sankeyNetwork()` to `diagonalNetwork()` using the same graphs and same data structures?

Contributor guide

No contributing guide indexed for this repository

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.