Mr.Alright---AndroidStudio3.0 Canary 8注解报错Annotation processors must be explicitly declared now.

体验最新版AndroidStudio3.0 Canary 8的时候,发现之前项目的butter knife报错,用到注解的应该都会报错
Error:Execution failed for task ':app:javaPreCompileDebug'.
> Annotation processors must be explicitly declared now.  The following dependencies on the compile classpath are found to contain annotation processor.  Please add them to the annotationProcessor configuration.
    - butterknife-7.0.1.jar
  Alternatively, set android.defaultConfig.javaCompileOptions.annotationProcessorOptions.includeCompileClasspath = true to continue with previous behavior.  Note that this option is deprecated and will be removed in the future.
  See https://developer.android.com/r/tools/annotation-processor-error-message.html for more details.

在app的build中
android {
    ...
    defaultConfig {
        ...
        //添加如下配置就OK了
        javaCompileOptions { annotationProcessorOptions { includeCompileClasspath = true } }
    }
    ...
}
  • 25
    点赞
  • 35
    收藏
    觉得还不错? 一键收藏
  • 27
    评论
Alright, I understand your requirements. Here's a Python program that satisfies your specifications: ```python import queue # Define the 5x5 boolean two-dimensional array to represent the connectivity of the graphs graph = [ [False, True, False, True, False], [True, False, True, False, True], [False, True, False, True, False], [True, False, True, False, True], [False, True, False, True, False], ] # Define the depth first traversal function def depth_first_traversal(graph, start): visited = [False] * len(graph) stack = [start] while stack: vertex = stack.pop() if not visited[vertex]: print(vertex, end=" ") visited[vertex] = True for i in range(len(graph)): if graph[vertex][i] and not visited[i]: stack.append(i) # Define the breadth first traversal function def breadth_first_traversal(graph, start): visited = [False] * len(graph) q = queue.Queue() q.put(start) while not q.empty(): vertex = q.get() if not visited[vertex]: print(vertex, end=" ") visited[vertex] = True for i in range(len(graph)): if graph[vertex][i] and not visited[i]: q.put(i) # Choose a reasonable starting position for the traversal based on the connectivity of the graph start = 0 for i in range(len(graph)): if sum(graph[i]) > sum(graph[start]): start = i # Perform depth first traversal print("Depth First Traversal:") depth_first_traversal(graph, start) # Perform breadth first traversal print("\nBreadth First Traversal:") breadth_first_traversal(graph, start) ``` In this program, we first define the 5x5 boolean two-dimensional array `graph` to represent the connectivity of the graphs that need to be traversed. Then, we define the `depth_first_traversal` function and the `breadth_first_traversal` function to perform depth first and breadth first traversal of the graph respectively. Next, we choose a reasonable starting position for the traversal based on the connectivity of the graph. We do this by iterating over each vertex in the graph and comparing the number of its neighbors to the number of neighbors of the current starting vertex. We choose the vertex with the highest number of neighbors as the starting position. Finally, we call the `depth_first_traversal` function and the `breadth_first_traversal` function with the `graph` and `start` arguments to perform the traversals. The output of the program will be the sequence of vertices visited during the traversals.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 27
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值