-
Modules over integral domain lack basic functionality:
```
sage: S. = PolynomialRing(QQ)
sage: A = S**2
sage: A
Ambient free module of rank 2 over the integral domain Multivariate Polynomial Ring i…
-
Example: https://mila.quebec/en/publications/
It would be nice to reuse the same code as in the Mila website. Not sure if that's 'easily' possible via RTD
-
This is a really cumbersome way of checking the ~equality~ equivalence of two programs --- furthermore, it doesn't take into account programs with the same DAG but different temporal operations list.
…
-
```
vf3lib is a software library containing all the currently published versions of VF3,
the fastest algorithm to solve subgraph isomorphism on large and dense graphs.
Extremely efficient in time …
-
### Information
- **retworkx version**: main
- **Python version**: Any
- **Rust version**: Any
- **Operating system**: Any
### What is the current behavior?
`is_subgraph_isomorphic` re…
-
@mtwhyte @reiniscirpons may add some further details to this.
-
For some substructure queries count matches does not return a result:
aMolecule:= indigoLoadMoleculeFromFile('Problem_SSS.mol');
indigoAromatize(aMolecule);
aQuery:= indigoLoadQueryMoleculeFro…
-
A lot of specific problems are tailored to specific hardware topologies of qubits; or a problem is defined on a structured topology and mapped to a hardware topology. Specific examples:
1. QAOA "ha…
-
e.g. FlagOrbitRepresentatives(M) for a k-orbit maniplex would return a list of k flags, one per orbit.
Some functions might be more efficient by using this. For example, the code for finding all fa…
-
Hello,
On the home page of this project, you kindly have mentioned that you maintain the ```jena-sparql-api-jgrapht``` for converting RDF and SPARQL queries into graphs to apply the subgraph isomorp…