-
Add support for graphs.
A graph G can be represented with an adjacency matrix of G. If the matrix is symmetrical the graph is undirected. If the coefficients of the matrix are only 0 or 1, then G i…
-
first as on https://ichi.moe
- https://readevalprint.tumblr.com/post/97467849358/who-needs-graph-theory-anyway
- https://github.com/tshatrov/ichiran
or https://jisho.org
-
Not really a feature request per se, but just wanted to share some info/references/libs that I've been collating recently RE: stack graphs, and how they can be used for better 'code navigation awarene…
-
Cyclomatic complexity analisis fails for some ternary operator examples like:
```
void example() {
char var = something ? 'a' : (anotherthing ? 'b' : 'c' );
printf("%c\n", var);
}
```
It retu…
-
Boost has a nice concept of "filters" of a graph. They provide views into subsets of the vertices and/or edges of the graph, based on predicate functions. That would be nice to have.
See [http://…
-
At the moment, we have _custom-coded implementations_ for every algo and data structure mentioned in the "Graphs in Python - Theory and Implementation" course. That's absolutely fine and serves its pu…
-
We should consider including methods for graph-theoretic properties that are useful downstream. E.g.
* `roots()` to return the IDs of the graph's root demes.
* `components()` to return a list of g…
-
Add cpro algorithms including different type of sorting , graph theory projects
-
From Chris Godsil's wishlist:
```
>
>>> A database of small graphs. Put Ted Spence's strongly regular graphs
>>> into a
>>> database. (In this case the important thing is to have the graphs
>>> th…
-
Component: **graph theory**
_Issue created by migration from https://trac.sagemath.org/ticket/2687_