Kevin C

Try this: ``Euler's formula: \(e^{i\pi} +1 = 0\)``

Has anyone thought more about this? I find this issue quite interesting.

I will be giving this some more thought. I am hoping that there is some sort of Haskell graph algorithms library similar to what [LEDA](http://www.algorithmic-solutions.info/leda_guide/GraphAlgorithms.html) offers. Maybe an abstract interface...

I haven't expressed myself clearly. LEDA has its own graph representation. What I meant to say was to be able to have an interface for the graph algorithms that LEDA...

I could be missing some important nuances but I am just thinking out loud in the following. (Aside: I prefer to use the definitions of graphs and directed graphs in...

I ran into the same issue and I rolled back to runtime 4.0.0 as mentioned in your EDIT and everything is working as expected.

Any idea how this could be achieved?

Looks like there is a library of graph algorithms that actually don't need a concrete definition of a graph: https://hackage.haskell.org/package/search-algorithms-0.3.2/docs/Algorithm-Search.html

@snowleopard BTW, is there any connection between your work on algebraic graphs and [GraphBLAS](https://graphblas.org)?

Thank you for the helpful suggestion. Any chance that the string template could become a command-line option for CodeBraid?