28 August 2006
Boost to Python
by YukuanBlog前陣子費了番功夫評估一些工具,跑複雜網路的模擬實驗要用的。這些實驗,圖論用得特別兇;會用到許多隨機抽樣的東西;實驗結果、數據,也要以圖表繪出。
15 August 2006
Boost Graph Library - Python Bindings
by YukuanMarkThe Boost Graph Library Python bindings (which we refer to as "BGL-Python") expose the functionality of the Boost Graph Library and Parallel Boost Graph Library as a Python package, allowing one to perform computation-intensive tasks on graphs (or network
07 August 2006
30 July 2006
Dr. Dobb's | The Boost.Threads Library | Û 15, 2003
by YukuanMarkJust a few years ago it was uncommon for a program to be written with multiple threads of execution. Today Internet server applications run multiple threads of execution to efficiently handle multiple client connections. To maximize throughput, transactio
Dr. Dobb's | Regular Expressions in C++ | ] 25, 2001
by YukuanMarkRegular expressions form a central role in many programming languages, including Perl and Awk, as well as many familiar UNIX utilities such as grep and sed. The intrinsic nature of pattern matching in these languages has made them ideally suited to text p
29 July 2006
Boost Test Library
by YukuanMarkThe Boost Test Library provides a matched set of components for writing test programs, organizing tests in to simple test cases and test suites, and controlling their runtime execution. The Program Execution Monitor is also useful in some production (non-
Boost.Regex: Introduction
by YukuanMarkRegular expressions are a form of pattern-matching that are often used in text processing; many users will be familiar with the Unix utilities grep, sed and awk, and the programming language Perl, each of which make extensive use of regular expressions.
Boost Random Number Library
by YukuanMarkRandom numbers are useful in a variety of applications. The Boost Random Number Library (Boost.Random for short) provides a vast variety of generators and distributions to produce random numbers having useful properties, such as uniform distribution.
The Boost Graph Library
by YukuanMarkGraphs are mathematical abstractions that are useful for solving many types of problems in computer science. Consequently, these abstractions must also be represented in computer programs. A standardized generic interface for traversing graphs is of utmos
1
(9 marks)