代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/162016/10345427
txt visual graph被封装成delphi控件了！.txt
作者：zgj67
email: zgj67@yeah.net
日期：8/18/2001 5:06:58 PM
Visual <mark>Graph</mark>是一套完整的图形编程语言，能够非常方便地建造各种基于图形的界面, 制作各种行业专用的图形控件，还可以制作丰富多样的报表。她能够和其他开发语言实现互相调用，弥补这些语言在图形（或报表）处理方面的不足。曾用她独立开发完成容量达200兆的电力调度自动化系统 ...
www.eeworm.com/read/161836/10366799
cpp main.cpp
#include
#include
#include "Dijkstra.h"
int main()
{
unsigned size, v;//图的顶点总数，源顶点
ifstream fin("text.txt");//打开文件
while (fin>>size) {//读完文件则结束
cout
www.eeworm.com/read/161587/10393606
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/161587/10393631
cpp awdgraph.cpp
// test adjacency matrix weighted digraphs
#include
#include "awdgraph.h"
void main(void)
{
AdjacencyWDigraph G(4,100);
cout
www.eeworm.com/read/161587/10393987
out kruskal.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
enter edge 9
The input graph is
Vertex 1 = 6
www.eeworm.com/read/161587/10394156
cpp awgraph.cpp
// test adjacency matrix weighted graphs
#include
#include "awgraph.h"
void main(void)
{
AdjacencyWGraph G(4,100);
cout
www.eeworm.com/read/161587/10394217
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/161587/10394301
out cover.out
Enter 25 edges of a 17 vertex graph
The graph is
Vertex 1 = 13 8 9 7 6 4
Vertex 2 = 5 6 8 4
Vertex 3 = 12 8 14 15 10
Vertex 4 = 17 2 1
Vertex 5 = 16 2
Vertex 6 = 16 2
www.eeworm.com/read/161587/10394928
cpp lgraph.cpp
// test linked adjacency list graph class
#include
#include "lgraph.h"
void main(void)
{
LinkedGraph G(4);
cout
www.eeworm.com/read/161587/10395234
cpp agraph.cpp
// test adjacency matrix undirected graphs
#include
#include "agraph.h"
void main(void)
{
AdjacencyGraph G(4);
cout