On Tue, Apr 7, 2020 at 6:24 PM Andrzej Ostruszka wrote:
> >
> >>> +
> >>> + STAILQ_FOREACH(graph_node, &graph->node_list, next) {
> >>> + if (graph_node->node->flags & RTE_NODE_SOURCE_F) {
> >>> + if (graph_node->node->nb_edges == 0)
> >>> +
On 4/7/20 2:27 PM, Jerin Jacob wrote:
> On Tue, Apr 7, 2020 at 5:46 PM Andrzej Ostruszka wrote:
>
>>> +int
>>> +graph_bfs(struct graph *graph, struct graph_node *start)
>>> +{
>>> + struct graph_node **queue, *v, *tmp;
>>> + uint16_t head = 0, tail = 0;
>>> + rte_edge_t i;
>>> + s
On Tue, Apr 7, 2020 at 5:46 PM Andrzej Ostruszka wrote:
> > +int
> > +graph_bfs(struct graph *graph, struct graph_node *start)
> > +{
> > + struct graph_node **queue, *v, *tmp;
> > + uint16_t head = 0, tail = 0;
> > + rte_edge_t i;
> > + size_t sz;
> > +
> > + sz = sizeof(stru
On 4/5/20 10:55 AM, jer...@marvell.com wrote:
> 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 Dabilpu
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
5 matches
Mail list logo
