Mateusz Mazurek
Mateusz Mazurek
Hi, Could you provide similar support for actors as AddJwtBearer handler does ?
Based on Cypher language ``` MATCH (person:Person)-[:KNOWS]-(friend:Person)-[:KNOWS]- (foaf:Person) WHERE person.name = "Joe" AND NOT (person)-[:KNOWS]-(foaf) RETURN foaf ```
A vertex is part of a triangle when it has two adjacent vertices with an edge between them.
The connected components algorithm labels each connected component of the graph with the ID of its lowest-numbered vertex. For example, in a social network, connected components can approximate clusters.
Current graph data structure is developed for shortest path purpose. Refactor should allow using graph for wider amount of scenarios.
Dijkstra.NET will support persistence graphs engines.