arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.4366cs.DS
收藏

图迭代器:从算法中解耦图结构

Graph Iterators: Decoupling Graph Structures from Algorithms

Marco Nissen

摘要:

我将提出一种实现图算法的方法,这是不同于传统的方法。这项工作的动机是相信,从软件工程的一些想法应适用于图形算法。软件的可重用性是一个重要而又困难的问题,尤其是图算法。科学文献证明了大量的应用程序的图形算法作为子程序的其他算法。此外,许多来自不同领域的实际问题可以被建模为图问题,从而通过图算法来解决。第二章介绍了第三章中5种基本图算法所用到的数据结构。第四章讨论了一般图的最大基数匹配算法的实现。第五章介绍了C++中的一些技术,这些技术有助于以有效的方式实现数据结构和算法。最后,第六章是结束语。

英文摘要:

I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software is an important and difficult problem in general, and this is particularly true for graph algorithms. The scientific literature demonstrates plenty of applications of graph algorithms as subroutines for other algorithms. Moreover, many practical problems from various domains may be modeled as graph problems and hence solved by means of graph algorithms. Chapter 2 introduces some data structures that will be used in 5 basic graph algorithms in chapter 3. Chapter 4 discusses an implementation of a maximum cardinality matching algorithm for general graphs. Chapter 5 explains some techniques in C++, which are useful to implement the data structures and algorithms in an efficient way. Finally chapter 6 contains some concluding remarks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑