fool_fool的专栏

// File name : complex.h #ifndef _COMPLEX_H_ #define _COMPLEX_H_ #include using namespace std; class complex { public: complex(double x = 0, double y = 0) { real = x; imag = y; }

#ifndef _INHERIENCE_H_ #define _INHERIENCE_H_ #include using namespace std; class vehicle{ private: char* id; double price; char* owner; public: vehicle(char* iden = NULL, double pr

#ifndef _SHAPE_H_ #define _SHAPE_H_ #include using namespace std; class Shape{ public: virtual double area() const = 0; virtual double perimeter() const = 0; }; class Square; class Rect

1. 编写日历打印程序，要求实现如下的main函数：     class Calendar;     int main() {         Calendar c0;         Calendar c1(2013);         Calendar c2(2013, 4);         Calendar c3(2013, 4, 23);           cout

C++版Dijkstra最短路径算法 ///////////////////////////////////////////////////////////////////////////////////// //file:ShortestPath.h #ifndef _SHORTESTPATH_H_ #define _SHORTESTPATH_H_ #define MAX_

1. 给定一个带权（非负）有向图，打印输出从节点S到节点T的最短路径（要求打印最短路径长度和具体的路径） int main() {  Graph G;   // Graph is a class with template  G.build(data.txt);  // build the graph  Path path;  //Path is a class with templa