-
### Problem statement
Currently the only way to create and edit a HSM is with code. For larger and more complex HSM's it can be difficult to get a quick understanding of the structure of the HSM. A…
-
**Is your feature request related to a problem? Please describe.**
I am trying to compile our model with tensorrt these days with exported program, our model is not very big, the original graph conta…
-
Dear authors,
I am encountering an issue during the computation of Regions of Attraction (RoA) while using the MORALS framework, specifically with the `dytop` package. The issue arises when certa…
-
### Name:
```Gabow's Algorithm```
### About:
We propose implementing Gabow's Algorithm for finding Strongly Connected Components (SCC) in a directed graph. This algorithm is a lesser-known …
-
I recently discovered foam and I'm really liking it, especially since I have already settled on local plaintext markdown notes. The Roam Research "anti-hierarchy" approach might be great for proprieta…
-
## ❓ Questions & Help
Do you have a `radius_graph` function for periodic structure?
Otherwise I will think how I can implement one and propose a PR, any suggestions?
So far we are using [`pymatge…
-
Graph core has some overlapping data structures. Cleanup the data structures.
- node_map
- node_list
- node_names
-
Opening statement summary
This is Yun's peer review for Ruiyang's paper2.
Strong positive points
The overall logic and structure of the paper is awesome!
Critical improvements needed -> de…
-
Hi,
we can split up directed acyclic networks (DAGs) in sub-structures, namely forks, chains and colliders. These structures are defined by
- A --> B --> C (chain)
- B C (fork)
- A --> C
-
Given an undirected graph, the task is to perform Kruskal's Minimum Spanning Tree (MST) algorithm to find the Minimum Spanning Tree of the graph.
Kruskal’s algorithm is a greedy algorithm that find…