Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/gregors/marveluniversebfs

Last synced: 25 days ago
JSON representation

Host: GitHub
URL: https://github.com/gregors/marveluniversebfs
Owner: gregors
Created: 2016-04-05T15:56:17.000Z (almost 9 years ago)
Default Branch: master
Last Pushed: 2014-04-17T01:11:42.000Z (over 10 years ago)
Last Synced: 2024-10-28T12:04:58.199Z (2 months ago)
Language: Java
Size: 688 KB
Stars: 0
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md

Awesome Lists containing this project

README

        marveluniverseBFS

=================

This is a tool that can find the shortest path between any two nodes in a graph. It is customized to find the shortest lexicographic path between any two nodes (marvel characters) in a graph. It utilizes the BFS algorithm. It can be easily adapted to generate a graph that is based on different nodes and edges.

Instructions:

1. To run this program, run the main.class file using java.

2. It will shortly calculate the most central character and prompt you if you want to find his/her degree of centrality. To do so requires slighlty more time, as execution time increases exponentially with the size of the graph. If you choose to find the degree of centrality, the BFS algorithm will run through ~6400 times.

3. To find the shortest path between any two characters, you will be prompted for the name of the characters. They must be entered EXACTLY as they appear in the labeled_edges.tsv file, except without quotations.