代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/168218/9932917
cpp adigraph.cpp
// test adjacency matrix directed graphs
#include
#include "adigraph.h"
void main(void)
{
AdjacencyDigraph G(4);
cout
www.eeworm.com/read/168218/9933415
cpp ldigraph.cpp
// test linked adjacency list directed graph class
#include
#include "ldigraph.h"
void main(void)
{
LinkedDigraph G(4);
cout
www.eeworm.com/read/168218/9933419
cpp awdgraph.cpp
// test adjacency matrix weighted digraphs
#include
#include "awdgraph.h"
void main(void)
{
AdjacencyWDigraph G(4,100);
cout
www.eeworm.com/read/168218/9933454
cpp awgraph.cpp
// test adjacency matrix weighted graphs
#include
#include "awgraph.h"
void main(void)
{
AdjacencyWGraph G(4,100);
cout
www.eeworm.com/read/168218/9933460
cpp lwdgraph.cpp
// test of linked adjacency list weighted digraph class
#include
#include "lwdgraph.h"
void main(void)
{
LinkedWDigraph G(4);
cout
www.eeworm.com/read/168218/9933501
cpp lgraph.cpp
// test linked adjacency list graph class
#include
#include "lgraph.h"
void main(void)
{
LinkedGraph G(4);
cout
www.eeworm.com/read/168218/9933513
cpp agraph.cpp
// test adjacency matrix undirected graphs
#include
#include "agraph.h"
void main(void)
{
AdjacencyGraph G(4);
cout
www.eeworm.com/read/168218/9933516
cpp adigraph.cpp
// test adjacency matrix directed graphs
#include
#include "adigraph.h"
void main(void)
{
AdjacencyDigraph G(4);
cout
www.eeworm.com/read/168118/9938000
m cvpavgplot.m
function cvpavgplot( graph, axishandle, xleft, yleft, xright, yright, xlimits )
axes(axishandle);
cla;
hold off;
if( length(yleft) > 0 )
plot( xleft, yleft, 'y');
hold on;
end
if( length(yrig
www.eeworm.com/read/362558/9992581
c 7.7.c
/*用非递归过程实现深度优先搜索*/
void DepthFirstSearch(Graph g,int v0) /*从v0出发深度优先搜索图g*/
{
InitStack(S); /*初始化空栈*/
Push(S,v0);
while(!Empty(S))
{
v=Pop(S);
if(!visited(v)) /*栈中可能有重复结点*/
{