Search - graph - CodeBus

Search - graph - List

[ELanguage] DFA_REG DL : 0: 编译原理中的DFA转换为分析程序，由用户预先设计好DFA图，再通过程序提供的图形，画出DFA图。最后，由程序自动生成识别程序。-Compiler Construction Principles of the DFA analysis of the conversion process, designed by the user in advance DFA graph, and then through the procedures provided by graphics, draw DFA Fig. Finally, automatically generated by the process identification procedures.
Date : 2026-01-01 Size : 426kb User : 李亚成
[ELanguage] Simple_DFA DL : 0: DFA状态最少化的算法，即DFA的最小化-DFA state minimization algorithm, namely, DFA Minimization
Date : 2026-01-01 Size : 3kb User : 侯坤
[ELanguage] suanfa DL : 0: 实现识别标识符的状态转换图算法。掌握识别标识符的状态转换图的理论知识和算法实现。-Identifier to achieve recognition of the state transition map algorithm. Master identifier to identify the state transition graph theoretical knowledge and algorithms to achieve.
Date : 2026-01-01 Size : 1kb User : 陈斌
[ELanguage] DFA DL : 0: 输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成） -Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first table structure generated by a subset of re-painting DFA graph), DFA minimization (also requires drawing method)
Date : 2026-01-01 Size : 14kb User : liyingan
[ELanguage] redundantpaths DL : 0: c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
Date : 2026-01-01 Size : 2kb User : jazz
[ELanguage] 2 DL : 0: 词法分析器状态图转换识别标识符的状态转换图的理论知识和算法实现-Lexical analyzer state diagram conversion identifier to identify the state transition graph theory and algorithms to achieve
Date : 2026-01-01 Size : 21kb User : apple
[ELanguage] shortway DL : 0: finding shortway between to vertex in the graph
Date : 2026-01-01 Size : 930kb User : saeed
[ELanguage] Graph DL : 0: Date : 2026-01-01 Size : 224kb User : libingyang
[ELanguage] deletenode DL : 0: this program is usefull in graph for delete a node
Date : 2026-01-01 Size : 1kb User : vahid
[ELanguage] ber_awgn2 DL : 0: comparison of BER of unipolar line coding and polar line coding. graph of BER vs SNR
Date : 2026-01-01 Size : 1kb User : sherry
[ELanguage] DAG.CPP DL : 0: This program is used to generate Directed Acyclic Graph for any expression in compilers.
Date : 2026-01-01 Size : 1kb User : Abhishek
[ELanguage] HPLC DL : 0: 梯行图编译器，能够实对其他部分软件编写的梯形图程序进行编译，得到相应的机器代码-Ladder line graph the compiler
Date : 2026-01-01 Size : 1.67mb User : 王涛
[ELanguage] osrm-backend-master DL : 0: Open Source Routing Machine （OSRM）计算图像中最短的路径。coherentlyIt被设计很好运行与地图数据Openstreetmap项目。-Open Source Routing Machine computes shortest paths in a graph. It was designed to run well with map data the Openstreetmap Project.
Date : 2026-01-01 Size : 450kb User : Chen Zhang
[ELanguage] yedgen-svn.tar DL : 0: yEdGen can generate ANSI C code a graphml file. You can use yEd Graph Editor, save your flow chart (following some yEdGen rules) in graphml and open it with yEdGen to generate ANSI C code. You can extend yEdGen to generate code for other language. This tool is student oriented.-yEdGen can generate ANSI C code a graphml file. You can use yEd Graph Editor, save your flow chart (following some yEdGen rules) in graphml and open it with yEdGen to generate ANSI C code. You can extend yEdGen to generate code for other language. This tool is student oriented.
Date : 2026-01-01 Size : 45kb User : mlazcoz
[ELanguage] main_DSCDMA DL : 0: 版块是用香浓定理来述说扩频通信时传播原理。并用MATLAB的编程软件去建立一个直接扩频的仿真模型的，在排除其他因素的情况下可以观察曲线和动态图去分析直接扩频的可靠程度-Section in aromatic theorem is used to declare the spread spectrum communication transmission principle. With MATLAB programming software to build a simulation model of direct spread spectrum, in the case of rule out other factors can observe curve and dynamic graph to analyze the reliability of direct spread spectrum
Date : 2026-01-01 Size : 2kb User : zhangsan
[ELanguage] c DL : 0: a smart demo for netron ,a free draw graph opensource netron.-a smart demo for netron ,a free draw graph opensource netron.
Date : 2026-01-01 Size : 160kb User : yoyo