Re: [dpdk-dev] [PATCH v3 05/29] graph: implement internal graph operation helpers

> > +/* Check whether a node has connected path or parent node */ > > +int > > +graph_has_isolated_node(struct graph *graph) > > +{ > > + struct graph_node *graph_node; > > + > > + graph_mark_nodes_as_not_visited(graph); > > + > > + STAILQ_FOREACH(graph_node, &graph->node_list, next) {

Re: [dpdk-dev] [PATCH v3 05/29] graph: implement internal graph operation helpers

roe.eu; mattias.ronnb...@ericsson.com; > pbhagavat...@marvell.com; ndabilpu...@marvell.com > Subject: [dpdk-dev] [PATCH v3 05/29] graph: implement internal graph > operation helpers > > From: Jerin Jacob > > Adding internal graph API helpers support to check whether a graph has &g

[dpdk-dev] [PATCH v3 05/29] graph: implement internal graph operation helpers

From: Jerin Jacob Adding internal graph API helpers support to check whether a graph has isolated nodes and any node have a loop to itself and BFS algorithm implementation etc. Signed-off-by: Jerin Jacob Signed-off-by: Nithin Dabilpuram --- lib/librte_graph/Makefile| 1 + lib/librte