Home

Algorithms

Main algorithms:

1. Graph layout - T-FDP model link to paper
2. Key vertices - ∆-PFS + Dijkstra
3. Community finder wiki link

Classic algorithms

1. Strongly Connected Components (Kosaraju's)
2. Bridge search for a whole graph (Tarjan's)
3. Cycle search for a vertex (Johnson's)
4. Min Spanning Tree for a whole graphs (Kruskal's MST)
5. Shortest Path between two vertices (Ford-Bellman's)
6. Shortest Path between two vertices (Dijkstra's)

Storaging

WUDU supports different types of storaging, as mentioned before. Here are the ways you can use them:

SQLite

• Working with SQLite

Neo4j

• Working with Neo4j

JSON

WIP ;)