pptaszynski / aisdi-graf fork watch download tarball
public
Description: An application to find shortest paths in a graph specified by input file. A project for academic purposes. Created for the Algorithms and Data Structures laboratory classes.
Clone URL: git://github.com/pptaszynski/aisdi-graf.git 
Litle changes in comments
pptaszynski (author)
Wed Jun 11 15:05:11 -0700 2008
commit  9b806256bf9f25c93d6d7b11e20643cdad0ac828
tree    c48f922ba6759fd4cd59e68e325dba9599d4eea1
parent  ebee59b3ff8c85f90f547b7e9c8613659b9fb0ee
0
graf.h 
...
26
27
28
29
30
 
 
31
32
33
...
60
61
62
63
64
 
 
65
66
67
...
103
104
105
 
 
...
26
27
28
 
 
29
30
31
32
33
...
60
61
62
 
 
63
64
65
66
67
...
103
104
105
106
 
0
@@ -26,8 +26,8 @@ public:
0
   /**
0
    *  Public constructor.
0
    *
0
-	 *	@param	int xco
0
-	 *	@para	int yco
0
+	 *	@param	int
0
+	 *	@para	int
0
    *
0
    */
0
   Vertex ( int xco, int yco ) : x(xco), y(yco) {
0
@@ -60,8 +60,8 @@ public:
0
   /**
0
    *  Public constructor
0
    *
0
-	 *	@param Vertex * d
0
-	 *	@param double c
0
+	 *	@param Vertex*
0
+	 *	@param double
0
    */
0
   Edge( Vertex *d = 0, double c = 0.0 ) : dest(d), cost(c) { }
0
 
0
@@ -103,3 +103,4 @@ private:
0
   vertex_map vmap;
0
 
0
 }
0
+

Comments

    No one has commented yet.