EDFS中文社区首次AMA--EDFS项目解读

1.先请嘉宾简单的介绍一下自己,以及EDFS的团队背景~

  1. First, please briefly introduce yourselves and the background of the EDFS team to us.

大家好,我是 EDFS 联合创始人兼CEO。今天非常荣幸跟大家伙分享项目的进展,在币圈大家都叫我Rico, 专注于投资及孵化项目。

大家好,我是 EDFS 的cto。我是Ecore,搞操作系统文件系统驱动搞了一辈子的技术狗,负责EDFS的技术团队的开发工作。今天非常荣幸跟大家伙分享项目的进展,

Ecore and his technical team have been developing the real-time security file system for 15 years, which has been widely used in the security system for organisations and enterprises. In 2011, Ecore and his team started working with Founder Joe on several projects. In January 2020, the tech team and Joe met with Rico and Dunstan. They discussed and determined the many significant integrations EDFS could bring to the tech world - especially in NFT and decentralized storage. This is when the current EDFS concept finally materialized.

当我们拥有一群有远见的创业技术爱好者,他们希望不断改进我们周围的现有技术,

重大的技术就会被创新出来让每个人都可以使用。 Ecore和他的技术团队开发实时安全文件系统已有15年的历史,已广泛应用于组织和企业的安全系统。2011 年,Ecore 和他的团队开始与创始人 Joe 合作开展多个项目。 2020 年 1 月,技术团队和 Joe 与Rico 和 Dunstan 会见了。 他们讨论并确定了 EDFS 可以为科技界尤其是在 NFT 和去中心化存储方面,带来的许多重要集成。 凭借Joe和Rico 20多年的创业经验,加上Dunstan作为知名的OG和主权技术的建设者,以及出色的技术演示和商业讨论,今日的EDFS概念终于得以实现。

2.团队为什么想要做EDFS,推出EDFS的愿景初衷是什么呢?

  1. Why does the team want to establish EDFS and what is the original intention of launching EDFS?

EDFS is not only designed to manage the full life cycle of digital intellectual property (IP), but also an important extension of decentralized storage, and a milestone for blockchain to enter the real world.

NFT and decentralized storage are two successful examples of blockchain adoption in the realm of digital files, but they are still insufficient. Existing NFTs and decentralized storages do not have full life cycle protection, and this narrows the application range and business opportunity.

EDFS creates a standard for secure collaboration of on-chain data and off-chain encrypted digital files. It has a groundbreaking design which allows for decentralized storage combined with real-time security. By combining the kernel layer of the operating system with blockchain, we are able to protect both on-chain data and the full life cycle of off-chain files, of all data formats. EDFS safely expands the commerc

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
这段代码实现了一个无向图的欧拉路径搜索,其中参数v表示搜索起点,level表示当前搜索的深度。函数eDFS中使用了深度优先搜索算法,遍历图中的所有可能路径,并记录已经访问过的节点。 具体实现过程如下: 1. 首先判断起点v是否为欧拉路径的起点V1,如果是则输出当前的路径(即Paths数组中的元素),并返回。 2. 遍历起点v的所有邻居节点,对于每个未被访问过的邻居节点p->adjvex,进行以下操作: - 将边p->eno的编号记录到Paths数组的第level个位置上。 - 将邻居节点p->adjvex标记为已访问。 - 递归调用eDFS函数,以邻居节点p->adjvex作为新的起点,继续搜索。 - 在递归调用结束后,将邻居节点p->adjvex标记为未访问,以便后续搜索。 3. 当所有邻居节点都被遍历完后,函数返回。 下面是这段代码的完整实现: ```c #define MAX_VERTICES 100 #define MAX_EDGES 1000 struct edge { int adjvex; int eno; struct edge *next; }; struct graph { int nvertices; int nedges; struct edge *link[MAX_VERTICES]; } Graph; int Visited[MAX_VERTICES]; int Paths[MAX_EDGES]; int V1; void printPath(int level) { int i; for (i = 0; i < level; i++) { printf("%d ", Paths[i]); } printf("\n"); } void eDFS(int v, int level) { struct edge *p; if (v == V1) { printPath(level); return; } for (p = Graph[v].link; p != NULL; p = p->next) { if (!Visited[p->adjvex]) { Paths[level] = p->eno; Visited[p->adjvex] = 1; eDFS(p->adjvex, level + 1); Visited[p->adjvex] = 0; } } } int main() { int i, V2, E, v, w; struct edge *p; scanf("%d %d", &V1, &E); Graph.nvertices = V1; Graph.nedges = 0; for (i = 0; i < V1; i++) { Graph.link[i] = NULL; } for (i = 0; i < E; i++) { scanf("%d %d", &v, &w); p = (struct edge *)malloc(sizeof(struct edge)); p->adjvex = w; p->eno = i + 1; p->next = Graph.link[v]; Graph.link[v] = p; p = (struct edge *)malloc(sizeof(struct edge)); p->adjvex = v; p->eno = i + 1; p->next = Graph.link[w]; Graph.link[w] = p; Graph.nedges++; } Visited[V1] = 1; eDFS(0, 0); return 0; } ```

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值