Am 16.04.20 um 02:54 schrieb Deklan Webster:
> I, totally by accident, think I discovered the issue! In the process of
> setting up the testing between the reconstructive method, get_edges_prob
> method, and the simple stacked topological similarity classifier I
> accidentally set the graph to undi
Err, I meant, of course:
```
Directed : ~13/1000 correctly identified
Undirected: 488/1000 correctly identified
```
On Wed, Apr 15, 2020 at 8:54 PM Deklan Webster wrote:
> I, totally by accident, think I discovered the issue! In the process of
> setting up the testing between the reconstructive
I, totally by accident, think I discovered the issue! In the process of
setting up the testing between the reconstructive method, get_edges_prob
method, and the simple stacked topological similarity classifier I
accidentally set the graph to undirected without setting it back to
directed. The resu
Am 15.04.20 um 10:42 schrieb Franco Peschiera:
> I now would like to test giving edges a weight in order for that
> |cutoff| argument to use it. I know the |shortest_distance| function
> accepts weights of edges in order to do Dijkstra. Could the same be done
> with |all_paths| such that the search
Hello again Tiago,
First of all thanks for the resources and help. As you may expect, I
somewhat lack a specialized background in graph theory and so I sometimes
miss the correct terminology.
As a reminder, this is a DAG. I haven’t, yet, implemented the random
unbiased generator version of all_pa
