-
I recently had to rewrite a [KDTree](https://github.com/SEL-Columbia/NetworkBuild/blob/master/networkbuild/KDTree.py) to support finding nearest neighbors within a subset of the input data. In additio…
-
Dear Igraph team,
I'm working on a nursing home and hospital transmission study of SARS-CoV-2 using your igraph package to create and calculate with graphs. My current results are based on the crea…
-
Could you please share hyperparameter sets that were considered and tried during Graph Layout experiment for each of the SST?
-
@bergercookie
Hi,
I am currently using MRPT 1.5.6 and more specifically the CGraphSlamEngine class.
In this class, the graph is optimized (CGraphSlamEngine_impl.h l. 615) and, if a new node …
-
Configs in mock labs are for FE interfaces, and in VIRL they are all Gigs. Furthemore, they are grouped by 4 (0/0 - 0/3), and the numbering is wrong as well. I believe the L3 PC is not supported as we…
-
Here is a possible list of algorithms based on a graph that needs to be implemented
the languages in which the algorithm has been implemented is written in the bracket, please refrain from adding alg…
-
used Prim’s algorithm
- The MST guarantees that every room will be reachable. However, since it is a tree, it contains no cycles. There is only a single path from one room to any other room.
@ https:…
-
*Original issue: https://charm.cs.illinois.edu/redmine/issues/1309*
---
Currently, AMPI implements all communicators as their own separate chare array instances, and all collectives on those communic…
-
Right now to start a broadcast 1 instructor connects to ∞ (many) students and instructors.
But I can make students and instructors _relay_ broadcaster's stream to other peers.
Therefore there's still…
-
#### Description of the problem
The disjoint-set forest, also known as the union-find data structure, is used to keep track of disjoint sets. It supports efficient union and find operations. It is …