Lines Matching refs:graph
35 graph_node_has_loop_edge(struct graph *graph) in graph_node_has_loop_edge() argument
39 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_has_loop_edge()
47 graph_src_nodes_count(struct graph *graph) in graph_src_nodes_count() argument
52 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_src_nodes_count()
64 graph_node_has_edge_to_src_node(struct graph *graph) in graph_node_has_edge_to_src_node() argument
70 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_node_has_edge_to_src_node()
87 graph_nodes_count(struct graph *graph) in graph_nodes_count() argument
92 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_nodes_count()
99 graph_mark_nodes_as_not_visited(struct graph *graph) in graph_mark_nodes_as_not_visited() argument
103 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_mark_nodes_as_not_visited()
108 graph_bfs(struct graph *graph, struct graph_node *start) in graph_bfs() argument
115 sz = sizeof(struct graph_node *) * graph_nodes_count(graph); in graph_bfs()
144 graph_has_isolated_node(struct graph *graph) in graph_has_isolated_node() argument
148 graph_mark_nodes_as_not_visited(graph); in graph_has_isolated_node()
150 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_has_isolated_node()
156 if (graph_bfs(graph, graph_node)) in graph_has_isolated_node()
161 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_has_isolated_node()