| makism/dyconnmap |
89 |
|
0 |
0 |
almost 3 years ago |
3 |
November 26, 2019 |
5 |
bsd-3-clause |
Python |
| A dynamic connectome mapping module in python. |
| visdesignlab/graffinity |
27 |
|
0 |
0 |
about 4 years ago |
0 |
|
17 |
|
JavaScript |
| Graffinity: Visualizing Connectivity in Large Graphs |
| btrekkie/dynamic-connectivity |
16 |
|
0 |
0 |
almost 3 years ago |
0 |
|
0 |
mit |
Java |
| Data structure for dynamic connectivity in undirected graphs. Supports adding and removing edges and checking whether two vertices are connected (there's a path between them) in polylogarithmic time. |
| sk1712/brain_ged |
11 |
|
0 |
0 |
almost 9 years ago |
0 |
|
0 |
mit |
Jupyter Notebook |
| Graph matching of brain connectivity networks based on graph edit distance |
| raamana/hiwenet |
9 |
|
1 |
1 |
almost 4 years ago |
20 |
July 14, 2022 |
1 |
mit |
Python |
| Histogram-weighted Networks for Connectivity & Advanced Analysis in Neuroscience |
| cjain7/parconnect_SCC16 |
8 |
|
0 |
0 |
over 9 years ago |
0 |
|
2 |
apache-2.0 |
C++ |
| Computes connectivity in large graphs. To be used for SCC submission in SC16. |
| ParBLiSS/parconnect |
8 |
|
0 |
0 |
about 9 years ago |
0 |
|
3 |
apache-2.0 |
C++ |
| Computes graph connectivity for large graphs |
| rayjasson98/Java-Graph-Algorithms-Visualizer |
7 |
|
0 |
0 |
over 3 years ago |
0 |
|
0 |
mit |
Java |
| A graph algorithms visualizer written in Java visualizing the solution of the Strong Connectivity, Cycle Detection and Shortest Path problems |
| mcveanlab/Corticall |
6 |
|
0 |
0 |
almost 6 years ago |
0 |
|
0 |
other |
Java |
| Germline DNM caller based on LdBG assembly of pathogens |
| KnudsenMorten/MicrosoftGraphPS |
6 |
|
0 |
0 |
over 2 years ago |
0 |
|
0 |
mit |
PowerShell |
| Think of this PS-module as a helper for Microsoft Graph version-management, connectivity and data management using Microsoft Graph. |
