<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zlc_abc的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zlc_abc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zlc_abc]]></copyright><item><title><![CDATA[Latex 多行公式的对齐笔记1]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/131313681</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/131313681</guid><author>zlc_abc</author><pubDate>Tue, 20 Jun 2023 19:15:56 +0800</pubDate><description><![CDATA[后来发现array有两列，c的意思是中间对齐。实际上更好的是将cc都改成ll. 也就是下面效果。我们只需将第二行的c改成l，即按左对齐即可。今天我在敲下面公式时候，发现第一行的。这样的效果可以直接用。]]></description><category></category></item><item><title><![CDATA[C语言基础语法-屠龙第一步]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/107464497</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/107464497</guid><author>zlc_abc</author><pubDate>Mon, 20 Jul 2020 15:25:15 +0800</pubDate><description><![CDATA[C 语言是一门面向过程的、抽象化的通用程序设计语言，广泛应用于底层开发。
至于我为什么专注学习C语言，因为很多研究图论新算法等程序用C语言极为活跃。不得不学。否则难以看懂延伸。
可能更多的熟悉C的大佬们注重C的运行效率，哪怕编写废点力气。毕竟轮上C去解决一些图论算法，效率上来说要求高的不是一点点。如果是普通的程序我们完全可以用商业软件去做，或者python方便的语言去做。
写C语句脑子里得放相应的语法。对一些基础语法的学习非常有必要。这个不掌握后面寸步难行。不过学习的方式倒是可以多样，可以看教程，最有效的办]]></description><category></category></item><item><title><![CDATA[C语言基础学习笔记]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106976241</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106976241</guid><author>zlc_abc</author><pubDate>Fri, 26 Jun 2020 22:55:55 +0800</pubDate><description><![CDATA[学习链接https://www.runoob.com/cprogramming/c-tutorial.html

C 语言是一种通用的、面向过程式的计算机程序设计语言。1972 年，为了移植与开发 UNIX 操作系统，丹尼斯·里奇在贝尔电话实验室设计开发了 C 语言。 C 语言是一种广泛使用的计算机语言，它与 Java编程语言一样普及，二者在现代软件程序员之间都得到广泛使用。 当前最新的C语言标准为 C11 ，在它之前的C语言标准为 C99。

第一个C程序
#include &lt;stdio.h&gt;]]></description><category></category></item><item><title><![CDATA[Finding all cycles in undirected graphs]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106584797</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106584797</guid><author>zlc_abc</author><pubDate>Sat, 06 Jun 2020 11:16:31 +0800</pubDate><description><![CDATA[I need a working algorithm for finding all simple cycles in an undirected graph. I know the cost can be exponential and the problem is NP-complete, but I am going to use it in a small graph (up to 20-30 vertices) and the cycles are small in number.

The f.]]></description><category></category></item><item><title><![CDATA[Floyd-Warshall Algorithm介绍及各语言搜集比较]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106572808</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106572808</guid><author>zlc_abc</author><pubDate>Fri, 05 Jun 2020 16:17:17 +0800</pubDate><description><![CDATA[Floyd-Warshall Algorithm is an algorithm for finding the shortest path between all the pairs of vertices in a weighted graph. This algorithm works for both the directed and undirected weighted graphs. But, it does not work for the graphs with negative cyc.]]></description><category></category></item><item><title><![CDATA[KKT定理使用理论和应用续 2]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106570801</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106570801</guid><author>zlc_abc</author><pubDate>Fri, 05 Jun 2020 15:05:13 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[变上限积分求导公式(通用公式)]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106570461</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106570461</guid><author>zlc_abc</author><pubDate>Fri, 05 Jun 2020 14:56:03 +0800</pubDate><description><![CDATA[Leibniz integral rule.
Let f(x,t)f(x, t)f(x,t) be a function such that both f(x,t)f(x, t)f(x,t) and its partial derivative f(x,t)f(x, t)f(x,t) are continuous in ttt and xxx in some region of the (x,t)(x, t)(x,t)-plane, including a(x)≤t≤b(x)a(x) ≤ t ≤ b(x)a]]></description><category></category></item><item><title><![CDATA[tikz官方学习资料选择分析]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106533169</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106533169</guid><author>zlc_abc</author><pubDate>Wed, 03 Jun 2020 21:23:05 +0800</pubDate><description><![CDATA[This example is from the System layer title page of the TikZ and PGF
manual.


Author: Till Tantau
Source: The PGF/TikZ manual
Automata
Do you have a question regarding this example, TikZ or LaTeX in general? Just ask in the LaTeX Forum.
Oder frag auf Deu.]]></description><category></category></item><item><title><![CDATA[二部图汇总]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106532564</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106532564</guid><author>zlc_abc</author><pubDate>Wed, 03 Jun 2020 20:50:13 +0800</pubDate><description><![CDATA[This C++ Program checks whether Graph is a Bipartite using 2 Color
Algorithm Here is source code of the C++ Program to check whether
Graph is a Bipartite using 2 Color Algorithm.


/* C++ Program to Check whether Graph is a Bipartite using 2 Color Algorit.]]></description><category></category></item><item><title><![CDATA[图个数的计数-SageMath]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106481396</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106481396</guid><author>zlc_abc</author><pubDate>Mon, 01 Jun 2020 20:51:47 +0800</pubDate><description><![CDATA[I am trying to use the nauty graph generator to count the number of
non-isomorphic graphs with specified properties, but I am hindered by
the fact that it seems nauty_geng only allows a fixed number of
vertices. For example, the following code counts the .]]></description><category></category></item><item><title><![CDATA[KKT定理的思考起源-拉格朗日乘数定理  1]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106480577</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106480577</guid><author>zlc_abc</author><pubDate>Mon, 01 Jun 2020 20:25:51 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[不等式约束优化问题方法-KKT定理]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106480451</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106480451</guid><author>zlc_abc</author><pubDate>Mon, 01 Jun 2020 19:48:05 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[寻找满足特定条件的全部矩阵编程方法]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106476669</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106476669</guid><author>zlc_abc</author><pubDate>Mon, 01 Jun 2020 17:06:38 +0800</pubDate><description><![CDATA[F3F_3F3​域上的矩阵(矩阵元素均为0,1,2）满足对角线元素 a11+a22+a33=0a_{11}+a_{22}+a_{33}=0a11​+a22​+a33​=0的可逆(模3意义下)矩阵有多少个，分别列举出来

Clear[boolmat]
boolmat[n_Integer /; n &gt; 0] := Tuples[{0, 1, 2}, {n, n}]
s1 = Select[ 
boolmat[3], #[[1, 1]] + #[[2, 2]]+#[[3,3]] == 0 &amp;&am.]]></description><category></category></item><item><title><![CDATA[让SageMath方便使用的若干方法]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106455870</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106455870</guid><author>zlc_abc</author><pubDate>Sun, 31 May 2020 15:30:26 +0800</pubDate><description><![CDATA[1 编译器
安装Sagemath，找到安装文件按照说明安装即可。
1 自带 notebook快捷方式,  双击进入 jupyternotebook.
2 还可以在shell里面安装sage -pip install  jupyterlab.
打开在shell里面输入 sage -n jupyterlab即可.
安装资源在github里面. https://github.com/jupyterlab/jupyterlab
2 数学公式推导
更加数学化，在Sagemath命令行输入下面命令：
%display ]]></description><category></category></item><item><title><![CDATA[Maple绘图小技巧1]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106450958</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106450958</guid><author>zlc_abc</author><pubDate>Sun, 31 May 2020 08:56:11 +0800</pubDate><description><![CDATA[闲暇时间，归纳Maple绘图的小技巧。积少成多，以备平时不时之需。图像是扩展想象力的有力手段。掌握一定绘图技巧，非常有用。围绕问题探讨。这里不像教程那样一个一个去学习，因为已经过了那个阶段了。

二维图和三维图如何绘制到一起？



方法1
s1:=implicitplot3d(z=x*y, x=-8..8,y=-8..8,z=-8..8,axes=normal,style=pointline ):
s2:=implicitplot(x^2+y^2=1, x=-8..8,y=-8..8,axes=norm.]]></description><category></category></item><item><title><![CDATA[图论(圈或路结构相关)基础习题实战2]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106391819</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106391819</guid><author>zlc_abc</author><pubDate>Wed, 27 May 2020 22:12:18 +0800</pubDate><description><![CDATA[经常问的习题汇总




]]></description><category></category></item><item><title><![CDATA[定积分在不等式证明中的应用若干例子]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106391554</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106391554</guid><author>zlc_abc</author><pubDate>Wed, 27 May 2020 21:55:31 +0800</pubDate><description><![CDATA[本文主要内容摘自：
https://mp.weixin.qq.com/s/aP76JCwJMspxDcNBYwPAqQ





]]></description><category></category></item><item><title><![CDATA[二项式定理]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106388834</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106388834</guid><author>zlc_abc</author><pubDate>Wed, 27 May 2020 21:40:06 +0800</pubDate><description><![CDATA[二项式定理2.1什么是二项式定理2.1.1 研究历史2.1.2 二项式定理2.1.2定理描述及证明方法应用若干
2.1什么是二项式定理
2.1.1 研究历史
二项式系数的三角形排列通常被认为是法国数学家布莱兹·帕斯卡的贡献，他在17世纪描述了这一现象。但早在他之前，就曾有数学家进行类似的研究。例如，古希腊数学家欧几里得于公元前4世纪提到了指数为2的情况。公元前三世纪，印度数学家青目探讨了更高阶的情况。帕斯卡三角形的雏形于10世纪由印度数学家大力罗摩发现。在同一时期，波斯数学家卡拉吉和数学家兼诗人欧玛尔·海亚]]></description><category></category></item><item><title><![CDATA[生成函数方法温习]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106360784</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106360784</guid><author>zlc_abc</author><pubDate>Tue, 26 May 2020 17:27:14 +0800</pubDate><description><![CDATA[生成函数的方法应用
组合数学引论 科大版 书本例子




]]></description><category></category></item><item><title><![CDATA[好玩的冒泡排序]]></title><link>https://blog.youkuaiyun.com/zlc_abc/article/details/106170398</link><guid>https://blog.youkuaiyun.com/zlc_abc/article/details/106170398</guid><author>zlc_abc</author><pubDate>Sun, 17 May 2020 13:27:44 +0800</pubDate><description><![CDATA[1 冒泡排序定义和算法复杂性



计算机使用的目的在于提高效率，完成人类手工几乎不会完成的大规模计算。计算机的水平的提高主要得先用起来！ 第二个需要学习一些常规的算法和数据结构，否则即使达到目的，效率也是很低，不能体现计算机高效的特色。


不管什么算法，都是通过某种编程语言去实现的。至于使用什么语言这要仁者见仁，智者见智了。


作为非计算机专业，往往考虑的是可操作性，简洁性，一些数学软件已经实现的功能，打基础或者想了解原理去编写之外，没有必要所有都要自己去实现，舍近求远的方法往往不可取。善于借鉴前人成]]></description><category></category></item></channel></rss>