搜索资源列表
graph
- 用邻接矩阵法建一无向连通图（顶点信息为字符），分别用dfs（深度优先搜索）和bfs(广度优先搜索)遍历，输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output
ggg
- 基于图论的搜索有功输电断面的研究 -Search based on graph theory section of active transmission of search based on graph theory section of active transmission
branchandbound
- The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
People-Appearances-in-web
- Web实体关系获取 A Graph-Based Framework for Disambiguating People Appearances in Web Search-A Graph-Based Framework for Disambiguating People Appearances in Web Search
POJ-project-training
- POJ专题分类,按算法分类，包含基本算法、图算法、数据结构、简单搜索、动态规划、数学、数论、计算几何等-POJ thematic classification algorithm segments, including basic algorithms, graph algorithms, data structures, a simple search, dynamic programming, mathematics, number theory, computational geometr
link-analysis
- A technique that use the graph structure in order to determine the relative importance of the nodes (web pages). One of the biggest changes in our lives in the decade following the turn of the century was the availability of efficient and accurate We
opencv-doc
- 图像数据操作（内存分配与释放，图像复制、设定和转换） 图像/视频的输入输出（支持文件或摄像头的输入，图像/视频文件的输出） 矩阵/向量数据操作及线性代数运算（矩阵乘积、矩阵方程求解、特征值、奇异值分解） 支持多种动态数据结构（链表、队列、数据集、树、图） 基本图像处理（去噪、边缘检测、角点检测、采样与插值、色彩变换、形态学处理、直方图、图像金字塔结构） 结构分析（连通域/分支、轮廓处理、距离转换、图像矩、模板匹配、霍夫变换、多项式逼近、曲线拟合、椭圆拟合、狄劳尼三角化）
加强图
- 图 深度优先搜索遍历和 邻接矩阵，闫蔚敏版，简单易懂，适合平时交作业(Graph depth first search and adjacency matrix, Yan Yumin version, simple, suitable for everyday homework)