We don’t allow questions seeking recommendations for software libraries, tutorials, tools, books, or other off-site resources. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
接受
或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
发布评论
评论(4)
我已成功调用 SymPy 以从 C# 完成此操作。 SymPy 提供了一个相对强大的简化函数,我已经取得了很好的成功。现在我还不完全确定如何很好地打包它(不必安装ironpython),甚至不知道直接移植代码有多困难。
C#代码如下:
I've managed to successfully call into SymPy to get this done from C#. SymPy provides a relatively robust simplify function that I've had good success with. Now I'm not entirely sure how to package this nicely yet (not having to install ironpython), or even how hard a direct port of the code might be.
C# code as follows:
在相关的SO问题中可以找到一系列答案。尽管没有,除了 mathdotnet 之外,都落在符号的交叉点上(您在上面要求的那种简化) )、轻量级以及 .Net 上的可访问性。
我看到您已经找到了mathdotnet 论坛。请注意,它的一些开发人员是 SO 用户:
这可能会补充您所要求的支持。
There is a flurry of answers to be found in a related SO question. Though none, other that mathdotnet, fall at the intersection of symbolics (the kind of simplificaiton you are asking for above), lightweight-ishness, and accessibility on .Net.
I see you have already found the mathdotnet forum. Note a couple of its developers are SO users:
That might supplement the support you ask for.
Symbolism 是一个实现代数表达式自动简化的 C# 库。
根据您的示例表达式,以下程序:
在控制台上显示此内容:
Symbolism is a C# library which implements automatic simplification of algebraic expressions.
Going with your example expression, the following program:
displays this at the console:
您是否尝试过创建一些简单的类来实现调车场算法(逆波兰表示法)使用 堆栈处理后缀表示法处理堆栈处理?
Have you tried creating a few simple classes implementing the Shunting Yard Algorithm(Reverse Polish Notation) than process the postfix notation using stack processingstack processing?