Skip to content

Issues: dagrejs/graphlib

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

30 Open 72 Closed
30 Open 72 Closed
Author
Filter by author
Loading
Label
Filter by label
Loading
Use alt + click/return to exclude labels
or ⇧ + click/return for logical OR
Projects
Filter by project
Loading
Milestones
Filter by milestone
Loading
Assignee
Filter by who’s assigned
Sort
Sort by
Newest Oldest Most commented Least commented Recently updated Least recently updated Best match
Most reactions
👍 👎 😄 🎉 😕 ❤️ 🚀 👀

Issues list

Provide descendant() and anscestors() functions
#204 opened Oct 4, 2024 by voxoid0
Do you have a changelog
#195 opened Apr 18, 2024 by Glandos
1
findCycles algorithm fails for undirected graphs
#193 opened Apr 1, 2024 by StevenClontz
Implement minimizing crossing algorithms
#157 opened Aug 3, 2022 by db295
Bug Report:Get wrong answer when running dijkstra in an undirected graph
#143 opened Apr 16, 2022 by OceanPresentChao
graph.predecessors and graph.inEdges do not alway work
#127 opened Mar 16, 2021 by JohnPool
如何在jointjs中实现自动生成无向布局呢？
#126 opened Feb 26, 2021 by yajunfan
dijkstra gives wrong result
#124 opened Dec 5, 2020 by sigs
1
Order of edges per node is not preserved
#122 opened Sep 29, 2020 by geert56
1
setGraph(label) string like parameter ‘label’ make some misunderstand while it's just an accessor
#119 opened Jun 6, 2020 by zcqno1
Get a successor node from source with a specific label
#113 opened Mar 10, 2020 by kavuri
Node ID names affect Dijkstra algorithm
#112 opened Mar 3, 2020 by rgcook
2
findCycles ignores self-referencing cycles for graphs with named edges
#111 opened Feb 5, 2020 by hcomnetworkers
graph.filterNodes(filter) not in the wiki documentation
#107 opened Sep 15, 2019 by arnau
Can this lib calculate clustering coefficient?
#106 opened Aug 24, 2019 by zhangliangbo
Floyd Warshall on Undirected Graph
#105 opened Jun 27, 2019 by privateOmega
Enhancement Idea: Adding new BFS algorithm (forward and reverse) for finding full paths flow
#104 opened Jun 8, 2019 by assafsun
Sinks method returns incorrect output for undirected graph
#101 opened Apr 23, 2019 by lynxaegon
1
Incorrect behaviour in findCycles (unexistent edges)
#99 opened Jan 17, 2019 by ErunamoJAZZ
2
Incorrect node ID if its name starts with Number
#96 opened Nov 23, 2018 by NickRimer03
2
Path extraction function
#89 opened Aug 25, 2018 by dionyziz
1
Implement Bellman–Ford
#87 opened Aug 18, 2018 by dionyziz
1
3
Missing Nodes Exception when we create an Edge
#85 opened May 8, 2018 by punitganshani
Sinks method return [null]
#82 opened Apr 11, 2018 by ideli8
2
Add support for renaming nodes
#72 opened Nov 15, 2017 by FunkMonkey
1
ProTip! Adding no:label will show everything without a label.