It might be a very minor issue.

In the documentation about networkx - Communicability, it was written like below.

The communicability between pairs of nodes in G is the sum of **closed walk

steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

Besides the wiki, are there any plans to compile an API reference documentation?
I'm rather lost with a few things, particularly adding properties to the nodes on WebGL/Canvas. While I am one particular case, I think we could all agree having Documentation to read would be rather beneficial if not plain helpful.

Followed instructions from https://dev.grakn.ai/docs/general/quickstart and immediatly reached these errors :

grakn-core-all-windows-1.7.1>grakn.bat console --keyspace social_network --file ./schema.gql

22:08:17,078 |-INFO in ch.qos.logback.classic.LoggerContext[default] - Could NOT find resource [logback-test.xml]
22:08:17,078 |-INFO in ch.qos.logback.classic.LoggerContext[default] - Could

I wanted to use pytextrank together with spacy_udpipe to get keywords from texts in other languages (see https://stackoverflow.com/questions/59824405/spacy-udpipe-with-pytextrank-to-extract-keywords-from-non-english-text) but I realized, that udpipe-spacy somehow "overrides" the original spacy's pipeline so the noun_chunks are not generated (btw: the noun_chunks are created in lang/en/syntax_itera

perhaps with a screenshot

There are multiple graph generators that currently do not check their input for validity.

These need to be fixed:

• callaway_traits_game
• establishment_game

The following functions have been verified to check their arguments properly:

forest_fire_game

Please update the lists above as you verify functions or find new ones with problems.

This is marked as

The API docs are all I could find in the way of documentation. Needs examples and/or instructions. There are a few trivial examples in the API docs under Graph, but that's all I could find.

OS: MacOS 10.13.3
I installed the MeTA as instructed on setup guide. When I do the unit test

describe [ranker regression]
libc++abi.dylib: terminating with uncaught exception of type meta::corpus::corpus_exception: corpus configuration file (../data//cranfield/line.toml) not present

It would be handy for all edge operations to have both f(g, e) and f(g, src(e), dst(e)) defined by default on abstract graphs

On page:

https://github.com/YaccConstructor/QuickGraph/wiki/Observer-Concepts

It says:

VertexPredecessorRecorderObserver,
creates a dictionary that links vertices to their parent edge,

and

EdgePredecessorRecorderObserver,
create a dictionary that links vertices to their parent edge,

They are worded essentially the same. Is this intentional?

I think one of them pro

Hi friends, since many of you are starting to contribute for Hacktoberfest.

To not disallow beginners to contribute to the project, this issue can be taken up by anyone starting to learn data structures and algorithms.

You need to start solving the problems in the Hackerrank's Tracks and add your solutions in the branch named trackname in a new f

After opening #448, I noticed that even though my code compiled locally, there were compile errors on Travis. Partially this was because I had not seen the warnings during release build (as pip does not show them), partially this is because there are additional warnings enabled on Travis.

Looking at the Travis config, I was able to figure out the respective CMake flags and enable them locally.