cpettitt dig.js issues - Githubissues

cpettitt / dig.js

Graph algorithms for JavaScript

MIT License

20 stars 4 forks source link

issues

Newest

Newest Most commented Recently updated Oldest Least commented Least recently updated

Could I take ownership of 'dig' on npm?

#53 coolaj86 opened 6 years ago
0
Kill it dead

#52 cpettitt closed 11 years ago
0
Make addDummyNodes a reversible process

#51 cpettitt opened 12 years ago
0
Add pre-layout step

#50 cpettitt opened 12 years ago
0
Unnecessary type-2 conflicts with example graph

#49 cpettitt opened 12 years ago
1
Support variable width in dot x-position

#48 cpettitt opened 12 years ago
0
Add subgraph support

#47 cpettitt closed 12 years ago
2
Support for height based layout

#46 cpettitt opened 12 years ago
0
Support for clustering in dig.dot.layout

#45 cpettitt opened 12 years ago
0
dot: handle self loops

#44 cpettitt closed 12 years ago
1
dot: edge layout

#43 cpettitt closed 12 years ago
1
Integration with D3

#42 cpettitt opened 12 years ago
0
dot: handle default attributes (node, edge, graph) properly

#41 cpettitt opened 12 years ago
0
add graph-level attributes

#40 cpettitt opened 12 years ago
0
dot: investigate improved heuristics for ordering

#39 cpettitt closed 12 years ago
2
Find polyfill to replace helpers like dig_util_forEach

#38 cpettitt closed 12 years ago
1
dot: undo acyclic changes when no longer needed

#37 cpettitt closed 12 years ago
0
dot: implement Brandes Kopf coordinate assignment

#36 cpettitt closed 12 years ago
1
dot: implement barycenter heuristic

#35 cpettitt closed 12 years ago
0
dot: bilayer cross counting algorithm

#34 cpettitt closed 12 years ago
0
Add support for immutable graphs

#33 cpettitt closed 12 years ago
0
dot: consider optimizations from Eiglsperger 2005

#32 cpettitt opened 12 years ago
0
dot: implement network simplex algorithm

#31 cpettitt opened 12 years ago
1
dot: support edges with minimum length constraints

#30 cpettitt opened 12 years ago
0
dot: acyclic function

#29 cpettitt closed 12 years ago
1
Integrate with Travis-CI

#28 cpettitt closed 12 years ago
0
Graph equality assertion

#26 cpettitt closed 12 years ago
0
Cleanup variable pass

#25 cpettitt closed 12 years ago
0
Add weight function with Floyd Warshall algorithm

#24 cpettitt opened 12 years ago
0
Add weight function with Dijkstra's algorithm

#23 cpettitt opened 12 years ago
0
Measure perf diff between objects and closures

#22 cpettitt opened 12 years ago
0
Implement Prim's algorithm

#21 cpettitt closed 12 years ago
1
Add support for edge labels

#20 cpettitt closed 12 years ago
0
Add support for node labels

#19 cpettitt closed 12 years ago
0
dot: make acyclic graphs

#18 cpettitt closed 12 years ago
1
dig.data.Stack

#17 cpettitt closed 12 years ago
0
Dot Parser

#16 cpettitt closed 12 years ago
0
API documentation: dig.alg.sp.floydWarshall

#15 cpettitt opened 12 years ago
0
API documentation: dig.alg.sp.dijkstra

#14 cpettitt opened 12 years ago
0
API documentation: dig.Graph

#13 cpettitt opened 12 years ago
0
Implement Tarjan's SCC algorithm

#12 cpettitt closed 12 years ago
0
Explore prototypal pattern for class-like objects

#11 cpettitt closed 12 years ago
0
Dot format rendering

#10 cpettitt closed 12 years ago
0
Dijkstra's algorithm is naively greedy

#9 cpettitt closed 12 years ago
1
Provide fallback when Object.defineProperty is not available

#8 cpettitt closed 12 years ago
1
Eliminate use of Array.prototype.forEach

#7 cpettitt closed 12 years ago
1
Implement Fibonacci heap

#6 cpettitt closed 12 years ago
1
Implement Bellman-Ford algorithm

#5 cpettitt opened 12 years ago
0
README: add section with examples using the library

#4 cpettitt opened 12 years ago
0
README: add section about how this works

#3 cpettitt opened 12 years ago
0

Next