代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/204469/15338924
cpp p284.cpp
#include "iostream.h"
#include "assert.h"
const int NumVertices = 6; //图中最大顶点个数
const int MAXINT=32767;
class Graph { //图的类定义
private:
int n;
int Edge[NumVertice
www.eeworm.com/read/204071/15344890
cpp random_bipartite.cpp
/*
Copyright (C) 2003, Guillaume-Latapy - LIAFA (University of Paris 7)
Disclaimer: this code is provided 'as-is', without any express or
implied warranty. In no event will the authors be h
www.eeworm.com/read/201477/15407260
cpp kruskal.cpp
// test Kruskal's min cost spanning tree algorithm
#include
#include "lwg.h"
void main(void)
{
LinkedWGraph G(7);
EdgeNode t[7];
int n = 7;
int e, u, v,
www.eeworm.com/read/201477/15407344
out ldigraph.out
Edges = 0
The graph is
Vertex 1 = 4 3
Vertex 2 = 1 4
Vertex 3 =
Vertex 4 = 2
The graph after deleting is
Vertex 1 = 4 3
Vertex 2 = 1
Vertex 3 =
Vertex 4 = 2
Deletion
www.eeworm.com/read/201477/15407537
out lgraph.out
Edges = 0
The graph is
Vertex 1 = 4 2 3
Vertex 2 = 3 1 4
Vertex 3 = 2 1
Vertex 4 = 1 2
The graph after deleting is
Vertex 1 = 4 2 3
Vertex 2 = 3 1
Vertex 3 = 2 1
www.eeworm.com/read/201477/15407542
out bbtsp.out
enter number of edges of 7 vertex graph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
enter edge 8
Cost = 31
Optimal tour is
1 4 2 6 5 3 7
www.eeworm.com/read/201477/15407564
out short.out
enter number of edges of 5 vertex digraph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
The input graph is
0 4 2 0 8
0 0 0 4 5
0 0 0 1 0
0 0
www.eeworm.com/read/201477/15407758
cpp abfs.cpp
// test adjacency matrix graph class
#include
#include "ag.h"
void main(void)
{
AdjacencyGraph G(7);
int reach[8];
int n = 7;
cout
www.eeworm.com/read/201318/15410612
xml bichartarea.xml
This class represents the area where the charts inside a