TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

What are some real world applications of graph algorithms?

31 pointsby ablmfabout 5 years ago
Can you guys give some real world examples of what graphs algorithms people are actually using in applications?<p>Given a complicated graphs, say social networks, what properties&#x2F;quantity people want to know about them?

6 comments

nostrademonsabout 5 years ago
In search&#x2F;social&#x2F;IR: reputation graphs, PageRank, reachability, link canonicalization &amp; dupe detection, identifying &quot;objects&quot; that are referred to by different names (eg. people, company names, knowledge graph, synonyms, etc.), propagating properties known to one entity onto related entities.<p>In geo&#x2F;rideshare&#x2F;logistics: shortest-path routing, traffic flow, minimizing the distance driven by someone who needs to make multiple pickups, optimizing delivery routes.<p>In health: contact tracing, recommending closures of social activities<p>In industrial&#x2F;EE applications: circuit theory, flow networks, load stresses<p>In basic CS infrastructure: register allocation, dependency management, dead code removal, data-flow propagation, figuring out bandwidth requirements in a network
qppoabout 5 years ago
Here&#x27;s a real world graph problem that is probably worth some money.<p>Design a data structure that represents &quot;business logic&quot; as a graph and transformations between graphs.<p>Now given two distinct &quot;business logic&quot; data structures, A and B, write an algorithm that can:<p>- check if all flows&#x2F;paths through A are present in B<p>- if not, enumerate which paths are no longer present<p>- for each path not present in B that is in A, enumerate possible substitutions<p>- for any given path in A and B define a distance metric that estimates the cost of any flow in A versus in B<p>Now I haven&#x27;t don&#x27;t this so I don&#x27;t know if there&#x27;s an elegant way to do it without some serious category theory&#x2F;abstract algebra chops, but this is essentially a problem that costs millions of dollars in businesses. Evaluating changes to processes and their potential cost&#x2F;benefit as well as deltas to other processes when structures are changed is extremely expensive, and it&#x27;s why migrating ERPs or CRMs is so time consuming.<p>Of course for it to be real world, you need the business logic to be fuzzy because you don&#x27;t have all the information to define such graphs A and B perfectly.
评论 #23294894 未加载
Phil-bitplexabout 5 years ago
Most everything I work on is related to graphs if I squint enough.<p>But to take an example from my visual planning - Gameplan.global - i use graph algorithms to model task dependencies, as well as the grouping structure.<p>When the tasks and dependencies are modelled as a graph, and the user wants to change a dependency, I can check the graph for a cycle. If a cycle will be introduced after the change, the change is disallowed.<p>It&#x27;s not as grandiose as one could imagine for a very large social network graph, its practical and solved the problem I.
ecesenaalmost 5 years ago
Pixie is the recommendation engine at Pinterest, based on random walks on a graph: <a href="https:&#x2F;&#x2F;link.medium.com&#x2F;cgxBc05RO6" rel="nofollow">https:&#x2F;&#x2F;link.medium.com&#x2F;cgxBc05RO6</a>
dclusinabout 5 years ago
Graphs are used to model dependencies of software libraries. If your build system can detect circular dependencies it&#x27;s using a cycle detection algorithm of some kind.
Websterabout 5 years ago
Substructure and exact match molecule searches are example of graph matching algorithms
评论 #23298793 未加载