issues
search
dwalend
/
Disentangle
Customizable graph algorithms in Scala
MIT License
19
stars
3
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Publish for Scala 2.12
#15
Sciss
closed
6 years ago
4
Implement a functional heap
#14
dwalend
opened
10 years ago
0
Load up the enron dataset and poke around
#13
dwalend
opened
10 years ago
0
Store a largish graph in DynamoDB
#12
dwalend
opened
10 years ago
1
Try out scala-blitz to increase performance
#11
dwalend
opened
10 years ago
0
Try out scalameter for measuring performance
#10
dwalend
opened
10 years ago
0
Spin up machines on EC2 for measuring performance
#9
dwalend
opened
10 years ago
2
Try out sbt-buildinfo
#8
dwalend
opened
10 years ago
0
Better top-level index.html on gh-pages
#7
dwalend
opened
10 years ago
1
Should HeapOrdering extend Ordering instead of PartialOrdering?
#6
dwalend
closed
10 years ago
1
Create an indexed Set and hold nodes in that structure for IndexedDigraphs.
#5
dwalend
closed
10 years ago
1
Graph's innerNode should return a Set, not a Seq.
#4
dwalend
closed
10 years ago
1
FloydWarshall returns a MutableLabelDigraph, should return an IndexedLabelDigraph
#3
dwalend
closed
10 years ago
1
Better default arguments for Brandes' algorithm's allLeastPathsAndBetweenness
#2
dwalend
closed
10 years ago
1
custom LDiEdge with variable label; upsert replaced by label assignment;...
#1
peter-empen
closed
10 years ago
0