登录
首页 » Windows开发 » 一个很不错的基于SIP的voip软件电话,基本可用的

一个很不错的基于SIP的voip软件电话,基本可用的

于 2022-06-17 发布 文件大小:2.84 MB
0 185
下载积分: 2 下载次数: 1

代码说明:

一个很不错的基于SIP的voip软件电话,基本可用的-A very good SIP-based voip software phones, the basic available

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 2023-08-06 04:55:03下载
    积分:1
  • 钟表
    钟表-A demo shows how to program a clock.
    2022-10-11 19:10:04下载
    积分:1
  • 这是一个简单的windows游戏源程序,可以正常运行,但是高手会现有Bug...
    这是一个简单的windows游戏源程序,可以正常运行,但是高手会发现有Bug-This is a simple windows games source, can be normal operation, but you will find Bug
    2022-10-28 00:10:03下载
    积分:1
  • in VB program simulated mouse movement, and can allow programs to automatically...
    在VB程序中模拟鼠标的动作,可让程序自动动作。-in VB program simulated mouse movement, and can allow programs to automatically moves.
    2022-05-21 19:27:44下载
    积分:1
  • : AT89x52 TG12232B LCD source code
    :AT89x52 & TG12232B 液晶程序源代码-: AT89x52 TG12232B LCD source code
    2023-06-02 08:00:03下载
    积分:1
  • 超强的5vs5的代码,可用,VC程序
    球机器人仿真组SimuroSot5vs5的源程序   Soccer Robot Simulation Group SimuroSot5vs5 of the source.   VC直接编译,可运行,功能及其强大,打败很多优秀代码,进攻猛烈。防守积极,很适合研究。
    2022-01-31 08:46:21下载
    积分:1
  • vc commonly used data format conversion, such as wchar_t, char*, CString, int, e...
    vc中常用数据格式转换,如wchar_t,char*,CString,int等。-vc commonly used data format conversion, such as wchar_t, char*, CString, int, etc..
    2023-01-12 13:25:03下载
    积分:1
  • 利用动态规划技术和递推的办法,求出两个字母表A和B的最大公共字串长度。...
    利用动态规划技术和递推的办法,求出两个字母表A和B的最大公共字串长度。-The use of dynamic programming techniques and recursive approach to find the two alphabets A and B, the largest public string length.
    2022-08-13 06:57:52下载
    积分:1
  • K r u s k a l算法每次选择n
    K r u s k a l算法每次选择n- 1条边,所使用的贪婪准则是:从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步,其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边,每次考虑一条边。当考虑某条边时,若将其 加入到已选边的集合中会出现环路,则将其抛弃,否则,将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.
    2023-02-08 08:10:04下载
    积分:1
  • zhi shi yi ge su she guan li xi tong. zuo ke cheng she ji yong de.xi wang dui ni...
    这是一个宿舍生管理的报告,里面有源代码,很有用的,做课程设计很好-zhi shi yi ge su she guan li xi tong. zuo ke cheng she ji yong de.xi wang dui ni you yong.
    2022-02-05 02:40:11下载
    积分:1
  • 696516资源总数
  • 106605会员总数
  • 12今日下载