-
# Aim
linear ordering of vertices
# Details
Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before…
-
- [x] C
- [x] C++
- [ ] C# - @himanshusharma89
- [ ] CoffeeScript
- [x] Dart - @Rukmini-Meda
- [ ] Go
- [x] Java
- [x] JS - @JanaSabuj
- [ ] Kotlin
- [ ] Php
- [x] Python
- [x] Readme
- [ …
-
I'm looking for the topological sort feature. I've created a DAG in Gephi and I want to know the topological ordering of my nodes. I've searched everywhere in the program but I cannot find a way how t…
-
The [newest specification of ordering](https://github.com/enso-org/enso/issues/5742#issuecomment-1444995335) assumes `sort` falling back into _topological sort_ as soon as incomparable values are foun…
-
> **ermo**
> There doesn't appear to be a "clean" way to break the `brotli -> curl -> systemd -> util-linux -> python -> brotli` cycle, since all the builddeps are actually valid.
> If you could fin…
ermo updated
3 months ago
-
Enountered an issue with Topological log rendering by latest version of ngit sources, built in VS 2010.
Given a simple history of two merged branches:
```
$ git log --graph --oneline
* ba81db5 Me…
-
You're given a list of arbitrary jobs that need to be completed. These jobs are in form of distinct integer numbers. You're also given a list of dependencies.A dependency is represented as a pair of j…
-
## Motivation ("The Why")
I got this idea from [a github issue](https://github.com/npm/feedback/discussions/579).
### Example
I am proposing that we add a sorting algorithm for ordering the g…
-
DFS is useful for finding the dependencies of a node and can also be used for [topological sorting](https://en.wikipedia.org/wiki/Topological_sorting#Depth-first_search).
-
**Describe the bug**
In certain circumstances, eXist loses the ordering of in-memory nodes.
**Expected behavior**
I expected eXist to retain the ordering of in-memory nodes.
**To reprodu…