代码搜索：Graphs
找到约 1,209 项符合「Graphs」的源代码
代码结果 1,209
www.eeworm.com/read/161587/10394713
cpp lbfs.cpp
// test breadth first search on linke adjacency list graphs
#include
#include "lg.h"
void main(void)
{
LinkedGraph G(7);
int reach[8];
int n = 7;
cout
www.eeworm.com/read/161587/10395346
cpp ldbfs.cpp
// test breadth first search of linked adjacency list directed graphs
#include
#include "ldg.h"
void main(void)
{
LinkedDigraph G(7);
int reach[8];
int i, n = 7;
c
www.eeworm.com/read/418151/10964263
m dsexample2.m
function mod = dsexample2
% Design example for an 8th-order binary bandpass modulator.
% Altogether too much of the code is greared toward making the graphs
% look 'pretty'.
format compact;
J = 1i;
www.eeworm.com/read/462777/7196388
m bodemagpaper.m
function BodeMagPaper(om_lo, om_hi, dB_lo, dB_hi)
%BodePaper is Matlab code to generate graph paper for Bode plots. It generates
%a semilog graphs for making Bode plots of magnitude with the
%uni
www.eeworm.com/read/459616/7270204
cpp lwdfs.cpp
// depth first search of linked weighted graphs
#include
#include "lwg.h"
void main(void)
{
LinkedWGraph G(7);
int reach[8];
int n = 7;
cout
www.eeworm.com/read/197407/7997600
cpp indep.cpp
// max independent set by greedy method
#include
#include "lg7.h"
void main(void)
{
LinkedGraph G(0);
int m, C[100];
// try three graphs
for (int j = 1; j
www.eeworm.com/read/197407/7997769
cpp longest.cpp
#include
#include "awd1.h"
void main(void)
{
AdjacencyWDigraph G(0);
int L[101],
kay[101];
// try three graphs
for (int j = 1; j
www.eeworm.com/read/197407/7997843
cpp bipart.cpp
// check if a graph is bipartite
#include
#include "lg4.h"
void main(void)
{
LinkedGraph G(0);
int L[100];
// try two graphs
for (int j = 1; j
www.eeworm.com/read/197407/7998678
cpp dfstree.cpp
// find a depth-first spanning tree
#include
#include "lg2.h"
#include "edge.h"
void main(void)
{
LinkedGraph G(0);
Edge DT[100];
// try three graphs
for (in
www.eeworm.com/read/397115/8066362
m som_plotplane.m
function h=som_plotplane(varargin)
%SOM_PLOTPLANE Visualize the map prototype vectors as line graphs
%
% h=som_plotplane(lattice, msize, data, [color], [scaling], [pos])
% h=som_plotplane(topol, dat