ajagtian/graph_search_algorithms

Single source shortest paths and minimum spanning tree transformation for large graphs

Search Algorithms on large graphs

This is Java based library for search and trace algorithms used in large networks, like the social networks and communication networks.

Functionality - For Communication Networks ->

Create a minimum spanning tree for the network, trace a machine on network, find the nearest machine, find the cost of communication between 2 machines
....

Functionality - For social networks ->

find friends, friends of friends, find the degre of closeness, suggest friends
...

To run the code -> make some appropriate I/O of your choice, one such I/O implementation is given in MakeGraph class.

Sample input file - In the sample I/O, graph is fed into the algorithm through a txt file. Sample file is present in code base. Here is the structure of input.txt.

	input.txt - for searching a node
	- - - - - - - -
	

	line 1: choide of search algorithm
	line 2: source node
	line 3: target node
	line 4: number of nodes
	line 5: ---
		list nodes...
	line 5 + number of nodes - 1: ----
		graph in the form of adjacency matrix.
	line 5+2*number of nodes - 1. --end

To run the code

	javac Node.java Graph.java *.java

	java *.java

	-  *.java your I/O interface class