搜索资源列表
Girth-eightQC-LDPC
- The algorith divides rows in to four equal groups. The rows are then used to from a distance graph which is then transformed into a matrix. girth of eight is maintained by avoiding six-cycles in the graph construction
cycles
- Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency
EdgeDisjointCycles
- Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the ed
Count_Paths_and_Cycles
- A differect way to count all paths and cycles in graph. This document is in Postscr ipt format.
GrTheory
- 图论的相关MATLAB CODE 非常好用-grBase- find all bases of digraph grCoBase- find all contrabases of digraph grCoCycleBasis- find all independent cut-sets for a connected graph grColEdge- solve the color problem for graph edges grColVer- sol
MAMS
- program to find all cycles in a graph
reducing_cycles
- reduces cycles in bipartite graph
cycleCountBacktrack
- count cycles in graph
girth63rr
- qc-ldpc码编程，围长为6，列重为3，无4环-The algorithm divides rows into three equal groups. The rows are then connnected to form a distance graph which is then transformed in to a matrix. Girth of six is maintained by avoiding four-cycles. No two rows are connected
girth12rr
- QC-LDPC码生成矩阵编程，围长为12，无4环-The program searches for a girth 12 QC-LDPC code given size of sub-matrix, row and column weights. The configuration of sub-matrices could also be changed. The program offers flexibility in constructing girth-12 QC-LDPC codes
amalkarde-Maghz-dar-zanan-va-mardan
- Suppose we are given a directed graph G=(V,E) and a weight function w: E->R. We assume that G does not contain cycles of weight 0 or less.
Arshad93RegBook
- we are given a directed graph G=(V,E) and a weight function w: E->R. We assume that G does not contain cycles of weight 0 or less.
asp-learning-pdf
- are given a directed graph G=(V,E) and a weight function w: E->R. We assume that G does not contain cycles of weight 0 or less.
headerdep
- Detect cycles in the header file dependency graph.
fftcode_scope_THD
- fftcode_scope computes and displays spectrum of a signal stored in a Structure with Time format (Format used to save signals in Simulink Scope block and in To Workspace block). The signal must be sampled at fixed step. PSBFFT_SCOPE perf
Brain-Waves-Graph
- The third wave is produced by the brain. Frequency brain waves, in full waking state can vary 14 to 21 cycles per second that it is called beta brain waves. Hvshyaryman be low when for any reason, eg when lying down to sleep on the bed or floor
play-titan-demo-master
- Java application to list all cycles in an undirected and directed graph