A static analysis tool for Java programs, based on the theory of code property graphs.

SolrCloud RDF store to find entity-relations via solr 6.6.2 custom streaming query

Labs for Data Structures and Algorithms

The course provides algorithmic thinking skills and acquire skills in working with the main classes of algorithms used in practice: recursion and backtracking, recursion using variables, combinatorial algorithms, search, sorting and greedy algorithms, as well as graph theory - implementation in computer memory, traversal and finding the shortest…

Gremlinator: An effort towards converting SPARQL queries to Gremlin Graph Pattern Matching Traversals

Representation of a directed Graph using Maps.

This program implements varius graph traversal algorithms (BFS/DFS/A* etc.) to find and display the best way to finish a maze.

This small project is for performing operations on graph, traversal (both BFS and DFS), and searching a path between two nodes.

Collection of practical codes for Savitribai Phule Pune University's Artificial Intelligence (310258) .

Multi-source BFS Algorithm for Graph Traversal

JAVA Boiler-plate for Graph related questions which are asked in most coding competitions. The current implementation enables the user to plug-in the business logic as a saperate class, by following simple procedure. This is highly useful in scenarios where the users want to solve a graph related problem without creating the graph related infra.

Implementation of basic algorithms in Java.