Skip to content
#

graph-analytics

Here are 41 public repositories matching this topic...

bkamins
bkamins commented Jan 23, 2021

I have a gh graph on 37700 vertices and 289003 edges.

Calculation of its diameter like this:

maximum(maximum(gdistances(gh, i)) for i in vertices(gh))

takes around 250 seconds (probably this is not an optimal algorithm for the task but at least it works).

However, when I run diameter(gh) the process takes so long that I did not wait till it finished.

Open Semantic Visual Linked Data Graph Explorer: Open Source tool (web app) and user interace (UI) for discovery, exploration and visualization of direct and indirect connections between named entities like persons, organizations, locations & concepts from thesarus or ontologies within your documents and knowledgegraph

  • Updated Jan 16, 2020
  • HTML

Improve this page

Add a description, image, and links to the graph-analytics topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the graph-analytics topic, visit your repo's landing page and select "manage topics."

Learn more