1.4.2 Greatest hits from previous weeks

1.4.2.1 Efficient way to build a certain quadratic matrix

http://mathematica.stackexchange.com/questions/51798/efficient-way-to-build-a-certain-quadratic-matrix

 
For odd n I'm looking for a short and swift way to construct with (f.e.) 
 
n = 3 
 
 
 
 
n = 11 
 
 
 
 
n=1111
 

- asked by eldo (15 votes), answered by RunnyKine (15 votes)

1.4.2.2 Finding all simple paths between two vertices in a graph

http://mathematica.stackexchange.com/questions/25779/finding-all-simple-paths-between-two-vertices-in-a-graph

 
There are built-in methods to find a shortest path between two vertices 
in a graph, and the question on finding all shortest paths between two 
vertices has gathered quite a bit of attention. 
 
A path  ...
 

- asked by mrm (11 votes), answered by trybik (10 votes)