Hi Sajith,
There is a possibility of doing this. However, the effort required to
implement a graph is minimal. For example, a graph can be implemented using
adjacency list and basic operations on a graph are very simple to implement.
Regards,
Bhagya Rupasinghe
Software Engineer Intern
Mobile
Hi Sasikala,
Input stream is not a set of vertices.The input stream contains a pair of
vertices adjacent to each other. The siddhi extension accepts two adjacent
vertices as the input. I have used a Hashmap to create an adjacency list to
generate the graph.
Regards,
Bhagya Rupasinghe
Software
Hi all,
Implementation in Siddhi
Maximum clique is used to identify the largest number of vertices in the
same entity which are connected to each other.In the Siddhi implementation,
input stream containing user IDs are added into a graph as vertices. And
then edge is created between them to show t
