graphstream

holderlb/graph-stream-generator

The Graph Stream Generator (GSG) generates multiple streams of graph vertices and edges according to subgraph patterns that can be partitioned across different streams.

Tressos-Aristomenis/A-Star-and-BFS-Searching-Visualization

Searching Visualization in a Graph using A* and BFS Algorithms. Imported GraphStream library for the GUI.

NickSklA/A-Star-and-BFS-Searching-Visualization

Searching Visualization in a Graph using A* and BFS Algorithms. Imported GraphStream library for the GUI.

IdrissRio/DucktypeSystem

A distributed DucktypeSystem 🦆

qanastek/Traveling-Salesman-Problem

This software is an easy to use traveling salesman problem interface which allow you to demonstrate to childrens how the Dijkstra algorithm works.

SolangeUG/information-flow

Capstone project of the Coursera "Object Oriented Java Programming: Data Structures and Beyond" specialization. It investigates the cascading behavior (or information flow) within a social network.

ariyadey/JAST

Universal AST Generator with GUI

DamienLegros/dedale

Projet FOSYMA master 1 ANDROIDE : 2020 - 2021 Projet d'introduction aux systèmes multi-agents codé en Java

jordilaforge/graphstream-fx

misrraimsp/travellingSalesman

Genetic Algorithms

pigypigypigy/Auxo

This repository contains the open source code of Auxo, a scalable and efficient graph stream summzrization structure

aesmonty/distributed-sys-Gossip

Asynchronous Gossip Protocol

alexandrabenamar/metabolic-pathways

A SWING interface for KEGG metabolic pathways: visualization of metabolical networks

guvenaltunsoyy/max-flow-min-cut-with-graph

Proje gerçekleştirimi ile beraber algoritma çözümleme yapısını anlamak ve çözüm sağlayabilmek amaçlanmaktadır.

marcosadsj/Java

r-kober/ReCaLys

Java-Application for analysing Reverse-Card-Sorting experiments from ReCaPo

shivsarthak/Dijkstra-Visualizer

End-Term project for Analysis and Design Of Algorithms

shraddhaarora/Socket-Programming

Write a program that involves a client and a server. The client sends server 4 values, for example X, n, B, C where, X is the adjacency matrix of a directed graph with m nodes (let’s say 5 nodes: A B C D E), and n is the length of the path from node B to node C. The server responds back with two responses: i. Positive Y response (or Negative N response) if there exists (or doesn't exist) a path of length n from B to C. ii. The image of the directed graph with nodes proving the validity of the response. For simplicity, assume that the above graph can have minimum 3 nodes and maximum 10 nodes

vonsowic/fff

FindFutureFriends

victor-ludorum/Subgraphs-of-Graph

This is project to graphically display subgraphs of graph with the use of jar file GraphStream

wellfernandes/np-modeling

Projeto de uma aplicação java desktop para modelagem de estados de forma gráfica, utilizando a biblioteca GraphStream.