GSoC Network Analysis - Revision history

Neteler: +Category:Network Analysis

2013-09-30T21:34:32Z

← Older revision		Revision as of 21:34, 30 September 2013
Line 211:		Line 211:

	{{GSoC}}		{{GSoC}}
			[[Category:Network Analysis]]

⚠️Landa: /* report #1 */

2011-03-13T12:49:40Z

report #1

← Older revision		Revision as of 12:49, 13 March 2011
Line 210:		Line 210:
	Daniel		Daniel

	~~[[Category:~~ GSoC]]		{{GSoC}}

⚠️Landa at 21:19, 10 April 2010

2010-04-10T21:19:13Z

← Older revision		Revision as of 21:19, 10 April 2010
Line 2:		Line 2:

	Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]		Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]
	Code: [http://svn.osgeo.org/grass/grass~~-addons~~/vector/~~net.analyze/~~]		Code: [http://svn.osgeo.org/grass/grass/trunk/lib/vector/neta]

	;Student: Daniel Bundala		;Student: Daniel Bundala

Neteler: hint that code i in G7 and G6.5

2010-04-10T19:58:06Z

hint that code i in G7 and G6.5

← Older revision		Revision as of 19:58, 10 April 2010
Line 1:		Line 1:
			Update 4/2010: the new modules are now available in GRASS 7.0.svn and GRASS 6.5.svn.

	Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]		Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]
	Code: [http://svn.osgeo.org/grass/grass-addons/vector/net.analyze/]		Code: [http://svn.osgeo.org/grass/grass-addons/vector/net.analyze/]

⚠️HamishBowman: add name/abstract

2010-03-04T18:29:39Z

add name/abstract

← Older revision		Revision as of 18:29, 4 March 2010
Line 1:		Line 1:
	Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]		Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]
	Code: [http://svn.osgeo.org/grass/grass-addons/vector/net.analyze/]		Code: [http://svn.osgeo.org/grass/grass-addons/vector/net.analyze/]

			;Student: Daniel Bundala

			;Abstract:
			: ''The goal of this project is to further develop vector network analysis in GRASS. This would involve computation of many centrality measures(degree, closeness, betweeness, eigenvalue…), requested v.net.distance module, time tables integrated into routing, various algorithms such max flows, min cuts, weakly and strongly connected components, minimum spanning trees, all pairs shortest paths, k-connectivity, articulation points, bridges, etc. ''


	== report #10 ==		== report #10 ==

⚠️Dano: Code link

2009-08-29T21:20:28Z

Code link

← Older revision		Revision as of 21:20, 29 August 2009
Line 1:		Line 1:
	Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]		Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]
			Code: [http://svn.osgeo.org/grass/grass-addons/vector/net.analyze/]

	== report #10 ==		== report #10 ==

⚠️Dano at 21:45, 15 August 2009

2009-08-15T21:45:34Z

← Older revision		Revision as of 21:45, 15 August 2009
Line 1:		Line 1:
	Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]		Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]

			== report #10 ==

			Hello all,

			This is the last report for this year Summer of Code. As last few weeks, I was finishing and cleaning code and documentation, doing some minor bug fixing, etc this week. There are no blocking issues (as should be the case at this stage:). For the next week(s), I plan to write my final summary report.

			Since the modules should be finished by now (I expect to make the final official commit on Sunday/Monday), you are all welcomed, (in fact, encouraged) to test them and please let me know if you find any bugs or anything I should know about. Even though I do not expect any major problems, beware of bugs in the code; I have neither proved it correct, nor tried it.

			Thanks for the great Summer (of Code),
			Daniel

	== report #9 ==		== report #9 ==

⚠️Dano at 18:14, 31 July 2009

2009-07-31T18:14:31Z

← Older revision		Revision as of 18:14, 31 July 2009
Line 1:		Line 1:
	Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]		Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]

			== report #9 ==

			Hello all,

			This week cleaned the code, fixed several undocumented features and documented the other ones. In more detail: There were still minor issues with the code and several module had nonstandard behaviour, which should be fixed now. I also spent some time documenting most of the modules. As users are probably not familiar with graph theory, I tried to explain the general notions in the description. Hope that it is not too little or not too much.....

			There are no blocking issues.

			Best,
			Daniel


	== report #8 ==		== report #8 ==

⚠️Dano at 22:00, 24 July 2009

2009-07-24T22:00:59Z

← Older revision		Revision as of 22:00, 24 July 2009
Line 1:		Line 1:
	Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]		Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]

			== report #8 ==

			Hello list,

			I worked mostly on module for finding fastest paths using timetables this week and I made several improvements. Firstly, the output is stored in two attributes tables. One for stops/points and another one for routes/lines. All information necessary to reconstruct the path and times is in these tables in the format very similar to the one used by v.net.path module. Secondly, the module can now output the route itself, not only stops joined by straight line segments. So instead of http://people.ksp.sk/~dano/grass/tt.png, you can get http://people.ksp.sk/~dano/grass/ttp.png. Although it is quite hard to see, note that the line joining two points on the left is a straight line. This is not a bug but a feature --this corresponds to walking between the stops. Thirdly, it is possible to give the coordinates of two points and the module finds the closest stop to each of them and hence the fastest path between them. Finally, I remember doing some minor bug fixes earlier this week, but I have already forgotten what it was...

			There are no blocking issues. I plan to, finally, polish and finish all modules next week and, if time permits, begin documenting modules and/or code.

			Cheers,
			Daniel

	== report #7 ==		== report #7 ==

⚠️Dano: /* report #6 */

2009-07-17T22:01:40Z

report #6

← Older revision		Revision as of 22:01, 17 July 2009
Line 1:		Line 1:
	Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]		Abstract: [http://socghop.appspot.com/student_project/show/google/gsoc2009/osgeo/t124023164520]

	== report #6 ==		== report #7 ==

	Hello all,		Hello all,