Let u and v be vertices of a graph. A path is a walk where no vertex is visited more than once (and consequently no edge traced more than once).
科学参考收录了60776条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。