-
### Background
There exist a number of core concepts in graph theory that are general enough to be useful outside of specific application use cases. Concepts such as strongly connected regions, s…
-
As explained confirmation from all node2vec papers, this algorithm is designed for 1 graph. It create specific embedding for each graph, so it is not possible for training node2vec model on a graph, t…
-
### Subroutines, ideas, foundational material.
- Quantum algorithm for finding the minimum https://arxiv.org/abs/quant-ph/9607014
- Quantum algorithms revisited https://arxiv.org/pdf/quant-ph/97080…
-
[SciSpark 202: Algorithms for MCC Search and PDF Clustering using SciSpark](http://live.commons.esipfed.bluedotapps.org/node/9029)
# Abstract/Agenda:
We introduce a 3 part course module on SciSpark, …
-
I just found javaparser, and it seems like a pretty neat tool! I have some experience using Soot and I was wondering what are the main differences between javaparser and Soot. For instance, I have use…
-
Add cpro algorithms including different type of sorting , graph theory projects
-
Currently we have spanning_trees function to list all the spanning trees of undirected graph. But does not take the weight of edges into account. This ticket aims at implementing such algorithms to …
-
This commit introduces the implementation of the Bellman-Ford algorithm, a widely used shortest path algorithm in graph theory. The algorithm efficiently calculates the shortest paths from a source ve…
-
I would like to implement my rejected proposal for GSoC during this autumn. [https://google-melange.appspot.com/gsoc/proposal/review/google/gsoc2012/brunellus/1](https://google-melange.appspot.com/g…
-