MSavameri
diff --git a/‎docs/source/LinearRegression.md‎
Lines changed: 1 addition & 1 deletion b/‎docs/source/LinearRegression.md‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎docs/source/LogisticRegression.md‎
Lines changed: 1 addition & 1 deletion b/‎docs/source/LogisticRegression.md‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎docs/source/NearestNeighbor.md‎
Lines changed: 1 addition & 1 deletion b/‎docs/source/NearestNeighbor.md‎
Lines changed: 1 addition & 1 deletion
@@ -82,4 +82,4 @@ When we visualize the graph in TensorBoard:
 
 ![linear-regression](_static/linear-regression-tensor-board.png)
 
-The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/LinearRegression.cs).
+The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/LinearRegression.cs).
@@ -13,4 +13,4 @@ The dependent variable of logistics regression can be two-category or multi-cate
 Softmax regression allows us to handle ![1557035393445](_static\logistic-regression\1557035393445.png) where K is the number of classes.
 
 
-The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/LogisticRegression.cs).
+The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/LogisticRegression.cs).
@@ -2,4 +2,4 @@
 
 The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem. In it, the salesman starts at a random city and repeatedly visits the nearest city until all have been visited. It quickly yields a short tour, but usually not the optimal one.
 
-The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/NearestNeighbor.cs).
+The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/NearestNeighbor.cs).
Original file line number	Diff line number	Diff line change
@@ -82,4 +82,4 @@ When we visualize the graph in TensorBoard:
82	82
83	83	![linear-regression](_static/linear-regression-tensor-board.png)
84	84
85		- The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/LinearRegression.cs).
	85	+ The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/LinearRegression.cs).
Original file line number	Diff line number	Diff line change
@@ -13,4 +13,4 @@ The dependent variable of logistics regression can be two-category or multi-cate
13	13	Softmax regression allows us to handle ![1557035393445](_static\logistic-regression\1557035393445.png) where K is the number of classes.
14	14
15	15
16		- The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/LogisticRegression.cs).
	16	+ The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/LogisticRegression.cs).
Original file line number	Diff line number	Diff line change
@@ -2,4 +2,4 @@
2	2
3	3	The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem. In it, the salesman starts at a random city and repeatedly visits the nearest city until all have been visited. It quickly yields a short tour, but usually not the optimal one.
4	4
5		- The full example is [here](https://github.com/SciSharp/TensorFlow.NET/blob/master/test/TensorFlowNET.Examples/BasicModels/NearestNeighbor.cs).
	5	+ The full example is [here](https://github.com/SciSharp/TensorFlow.NET-Examples/blob/master/src/TensorFlowNET.Examples/BasicModels/NearestNeighbor.cs).