-
This repository has classes [LineageTreeUtils](https://github.com/mastodon-sc/mastodon-tomancak/blob/8c723bf4ea957752b41170a4cf03567b91b5a5c0/src/main/java/org/mastodon/mamut/tomancak/lineage_registra…
-
The following function, when profile using %prun results in N^2+N calls to subs()
```def get_task(n, client):
futs = client.map(int, [random.random() for _ in range(n)])
z = str(uuid.uuid…
-
**My Graph notes, blogs and articles**
Mostly from Youtube and Graph Algorithm book by Shafayet Ashraf
-
In the kernel:
```
__kernel void buildRadixTree(__global struct BVHNode* nodeBuffer,__global uint2* mortonBuffer, uint leafCount)
{
uint idx = get_global_id(0);
if (idx < leafCount-2)
constr…
-
Title: Integrate an Embedded Code Editor for Practice
Details: You can embed a code editor within the DFS-BFS Graph Traversal app, allowing users to write and practice algorithms like DFS, BFS, or ot…
-
The docstring for `transitive_closure` contains the following note:
https://github.com/networkx/networkx/blob/906bf82ab7edf0ad4cea067b3be5a4e1cba356a3/networkx/algorithms/dag.py#L557-L558
Just r…
-
I have seen your HLBVH code, and would just like to please ask if this is related to:
"HLBVH: Hierarchical LBVH Construction for Real-Time Ray Tracing of Dynamic Geometry"
by J. Pantaleoni and and D…
-
Mapping crashes sometimes, forcing a catch-reset in [`mapping_node.h`](https://github.com/heuristicus/cob_environment_perception/blob/fd6b79e5260b0506b1761f4609c40b22bfe0ce06/cob_3d_mapping_geometry_m…
-
I have a `gh` graph on 37700 vertices and 289003 edges.
Calculation of its diameter like this:
```
maximum(maximum(gdistances(gh, i)) for i in vertices(gh))
```
takes around 250 seconds (probab…
-
**Dated: Oct-07-2020**
**Regarding Delay in reviewing PR**
Hello, everyone, I am one of the maintainer of this repository. I know most of the PRs are the part of **hacktoberfest** and most of you a…