Network layouts handle negative values
还没有人认领这个 Issue。
评估
- 难度
- 5/5
- 预计耗时
- 一周以上
- 新手友好度
- 25/100
- Issue 类型
- 功能
- 描述清晰度
- 需要澄清
- 活跃度
- 停滞
- 技术栈
- r
调研方向
Start with the force-directed layout entry points and igraph behavior for networks containing positive and negative edge weights. Compare results on representative networks rather than only small examples, including the WGCNA negative-edge use case. Done means the required behavior and scope are specified, including whether positive-only, negative-only, both, or absolute-value handling is needed.
由索引模型根据 Issue 内容生成。
描述
I did some looking and folks don't seem to be happy with how the force-directed layouts in igraph handle negative weights. Often the examples i saw only had a few nodes, so i think we should see how it goes with our networks and modify if needed.
If we do need to modify, one fun idea would be to have options for force-directed: positive only, negative only, both, or absolute value. Basically ways to keep all the edge weights on one side of 0 (except the "both" option). Kathryn was talking about how she's actually only interested in negative edges for the wgcna stuff, which led me to think about this plan.
- 主要语言
- R
- 星标
- 1
- 派生
- 0
- PR 合并指标
- 30 天内没有已合并 PR
贡献指南
这个仓库没有索引到贡献指南
从这里开始
- 先读完整个 Issue，再读项目的贡献指南。
- 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
- Fork 仓库，在一个分支上完成修改。
- 提交 Pull Request，并在描述里引用这个 Issue 编号。
VEuPathDB/plot.data 的其他 Issue
-
难度 2/5 1-3 小时 新手友好度 25/100
-
难度 3/5 1-2 天 新手友好度 35/100
-
难度 3/5 1-2 天 新手友好度 35/100
-
empty two by two 未关闭
难度 4/5 3-5 天 新手友好度 35/100
-
难度 5/5 一周以上 新手友好度 25/100
查看 VEuPathDB/plot.data 的全部 Issue
相似的 Issue
-
难度 2/5 1-3 小时 新手友好度 75/100
robjhyndman/forecast#1220 ·
-
难度 2/5 1-3 小时 新手友好度 65/100
JamesHWade/deputy#192 ·
-
难度 2/5 1-3 小时 新手友好度 75/100
-
bug triage_needed
难度 2/5 1-3 小时 新手友好度 75/100
-
难度 2/5 1-3 小时 新手友好度 72/100
pharmaverse/rtables#1123 · 1 条评论 · 1 个 reaction ·