Lines Matching refs:graph
34 graph_node_has_loop_edge(struct graph *graph) in graph_node_has_loop_edge() argument
38 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_has_loop_edge()
46 graph_src_nodes_count(struct graph *graph) in graph_src_nodes_count() argument
51 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_src_nodes_count()
63 graph_node_has_edge_to_src_node(struct graph *graph) in graph_node_has_edge_to_src_node() argument
69 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_node_has_edge_to_src_node()
86 graph_nodes_count(struct graph *graph) in graph_nodes_count() argument
91 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_nodes_count()
98 graph_mark_nodes_as_not_visited(struct graph *graph) in graph_mark_nodes_as_not_visited() argument
102 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_mark_nodes_as_not_visited()
107 graph_bfs(struct graph *graph, struct graph_node *start) in graph_bfs() argument
114 sz = sizeof(struct graph_node *) * graph_nodes_count(graph); in graph_bfs()
143 graph_has_isolated_node(struct graph *graph) in graph_has_isolated_node() argument
147 graph_mark_nodes_as_not_visited(graph); in graph_has_isolated_node()
149 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_has_isolated_node()
155 if (graph_bfs(graph, graph_node)) in graph_has_isolated_node()
160 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_has_isolated_node()